/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-24 00:29:56,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-24 00:29:56,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-24 00:29:56,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-24 00:29:56,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-24 00:29:56,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-24 00:29:56,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-24 00:29:56,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-24 00:29:56,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-24 00:29:56,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-24 00:29:56,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-24 00:29:56,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-24 00:29:56,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-24 00:29:56,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-24 00:29:56,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-24 00:29:56,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-24 00:29:56,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-24 00:29:56,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-24 00:29:56,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-24 00:29:56,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-24 00:29:56,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-24 00:29:57,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-24 00:29:57,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-24 00:29:57,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-24 00:29:57,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-24 00:29:57,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-24 00:29:57,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-24 00:29:57,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-24 00:29:57,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-24 00:29:57,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-24 00:29:57,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-24 00:29:57,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-24 00:29:57,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-24 00:29:57,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-24 00:29:57,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-24 00:29:57,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-24 00:29:57,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-24 00:29:57,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-24 00:29:57,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-24 00:29:57,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-24 00:29:57,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-24 00:29:57,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-02-24 00:29:57,030 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-24 00:29:57,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-24 00:29:57,031 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-24 00:29:57,031 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-24 00:29:57,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-24 00:29:57,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-24 00:29:57,032 INFO L138 SettingsManager]: * Use SBE=true [2022-02-24 00:29:57,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-24 00:29:57,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-24 00:29:57,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-24 00:29:57,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-24 00:29:57,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-24 00:29:57,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-24 00:29:57,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-24 00:29:57,033 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-24 00:29:57,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-24 00:29:57,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-24 00:29:57,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-24 00:29:57,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-24 00:29:57,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 00:29:57,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-24 00:29:57,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-24 00:29:57,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-24 00:29:57,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-24 00:29:57,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-24 00:29:57,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-24 00:29:57,035 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-02-24 00:29:57,035 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-24 00:29:57,036 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-24 00:29:57,036 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-24 00:29:57,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-24 00:29:57,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-24 00:29:57,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-24 00:29:57,237 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-24 00:29:57,238 INFO L275 PluginConnector]: CDTParser initialized [2022-02-24 00:29:57,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-02-24 00:29:57,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538ea4fd0/6e7a80fd5b1c4ba2af1f08c7d92f0cc2/FLAG0175cf5ba [2022-02-24 00:29:57,687 INFO L306 CDTParser]: Found 1 translation units. [2022-02-24 00:29:57,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-02-24 00:29:57,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538ea4fd0/6e7a80fd5b1c4ba2af1f08c7d92f0cc2/FLAG0175cf5ba [2022-02-24 00:29:58,062 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538ea4fd0/6e7a80fd5b1c4ba2af1f08c7d92f0cc2 [2022-02-24 00:29:58,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-24 00:29:58,065 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-24 00:29:58,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-24 00:29:58,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-24 00:29:58,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-24 00:29:58,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:29:58" (1/1) ... [2022-02-24 00:29:58,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f3bf81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:29:58, skipping insertion in model container [2022-02-24 00:29:58,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:29:58" (1/1) ... [2022-02-24 00:29:58,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-24 00:29:58,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-24 00:29:58,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2022-02-24 00:29:58,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 00:29:58,347 INFO L203 MainTranslator]: Completed pre-run [2022-02-24 00:29:58,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2022-02-24 00:29:58,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 00:29:58,421 INFO L208 MainTranslator]: Completed translation [2022-02-24 00:29:58,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:29:58 WrapperNode [2022-02-24 00:29:58,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-24 00:29:58,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-24 00:29:58,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-24 00:29:58,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-24 00:29:58,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:29:58" (1/1) ... [2022-02-24 00:29:58,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:29:58" (1/1) ... [2022-02-24 00:29:58,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:29:58" (1/1) ... [2022-02-24 00:29:58,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:29:58" (1/1) ... [2022-02-24 00:29:58,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:29:58" (1/1) ... [2022-02-24 00:29:58,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:29:58" (1/1) ... [2022-02-24 00:29:58,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:29:58" (1/1) ... [2022-02-24 00:29:58,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-24 00:29:58,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-24 00:29:58,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-24 00:29:58,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-24 00:29:58,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:29:58" (1/1) ... [2022-02-24 00:29:58,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 00:29:58,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-24 00:29:58,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-24 00:29:58,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-24 00:29:58,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-24 00:29:58,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-24 00:29:58,553 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-24 00:29:58,554 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-02-24 00:29:58,554 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-02-24 00:29:58,554 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2022-02-24 00:29:58,554 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2022-02-24 00:29:58,554 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2022-02-24 00:29:58,555 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2022-02-24 00:29:58,556 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2022-02-24 00:29:58,556 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2022-02-24 00:29:58,556 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2022-02-24 00:29:58,556 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2022-02-24 00:29:58,556 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2022-02-24 00:29:58,556 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2022-02-24 00:29:58,557 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2022-02-24 00:29:58,557 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2022-02-24 00:29:58,557 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2022-02-24 00:29:58,557 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2022-02-24 00:29:58,557 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-02-24 00:29:58,557 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-24 00:29:58,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-02-24 00:29:58,557 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-02-24 00:29:58,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-02-24 00:29:58,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-02-24 00:29:58,557 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-02-24 00:29:58,557 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-02-24 00:29:58,557 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-02-24 00:29:58,558 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-24 00:29:58,558 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-24 00:29:58,558 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-24 00:29:58,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-24 00:29:58,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-02-24 00:29:58,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-24 00:29:58,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-02-24 00:29:58,558 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2022-02-24 00:29:58,558 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2022-02-24 00:29:58,558 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2022-02-24 00:29:58,558 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2022-02-24 00:29:58,558 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2022-02-24 00:29:58,558 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2022-02-24 00:29:58,559 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2022-02-24 00:29:58,559 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2022-02-24 00:29:58,559 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2022-02-24 00:29:58,559 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2022-02-24 00:29:58,559 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2022-02-24 00:29:58,559 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2022-02-24 00:29:58,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-02-24 00:29:58,559 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-02-24 00:29:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-02-24 00:29:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-02-24 00:29:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-02-24 00:29:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-02-24 00:29:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-02-24 00:29:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-02-24 00:29:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2022-02-24 00:29:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2022-02-24 00:29:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-02-24 00:29:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-24 00:29:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-02-24 00:29:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-24 00:29:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-24 00:29:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-24 00:29:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-24 00:29:58,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-24 00:29:58,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-24 00:29:58,705 INFO L234 CfgBuilder]: Building ICFG [2022-02-24 00:29:58,708 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-24 00:29:58,763 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:29:58,839 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-02-24 00:29:58,839 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-02-24 00:29:58,844 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:29:58,878 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-02-24 00:29:58,878 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-02-24 00:29:58,899 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:29:58,917 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-02-24 00:29:58,917 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-02-24 00:29:58,924 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:29:58,935 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-24 00:29:58,935 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-24 00:29:59,083 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:29:59,101 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-02-24 00:29:59,101 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-02-24 00:29:59,118 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:29:59,126 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-02-24 00:29:59,126 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-02-24 00:29:59,147 INFO L275 CfgBuilder]: Performing block encoding [2022-02-24 00:29:59,154 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-24 00:29:59,154 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-24 00:29:59,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:29:59 BoogieIcfgContainer [2022-02-24 00:29:59,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-24 00:29:59,156 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-24 00:29:59,156 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-24 00:29:59,157 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-24 00:29:59,159 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:29:59" (1/1) ... [2022-02-24 00:29:59,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 24.02 12:29:59 BasicIcfg [2022-02-24 00:29:59,195 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-24 00:29:59,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-24 00:29:59,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-24 00:29:59,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-24 00:29:59,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 12:29:58" (1/4) ... [2022-02-24 00:29:59,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3caf4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:29:59, skipping insertion in model container [2022-02-24 00:29:59,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:29:58" (2/4) ... [2022-02-24 00:29:59,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3caf4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:29:59, skipping insertion in model container [2022-02-24 00:29:59,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:29:59" (3/4) ... [2022-02-24 00:29:59,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3caf4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 12:29:59, skipping insertion in model container [2022-02-24 00:29:59,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 24.02 12:29:59" (4/4) ... [2022-02-24 00:29:59,224 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.cqvasr [2022-02-24 00:29:59,227 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-24 00:29:59,228 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-24 00:29:59,290 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-24 00:29:59,294 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-24 00:29:59,295 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-24 00:29:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 295 states, 206 states have (on average 1.4271844660194175) internal successors, (294), 224 states have internal predecessors, (294), 61 states have call successors, (61), 26 states have call predecessors, (61), 26 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) [2022-02-24 00:29:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-24 00:29:59,315 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:29:59,315 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:29:59,316 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:29:59,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:29:59,321 INFO L85 PathProgramCache]: Analyzing trace with hash 13220813, now seen corresponding path program 1 times [2022-02-24 00:29:59,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:29:59,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033231584] [2022-02-24 00:29:59,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:29:59,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:29:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:29:59,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:29:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:29:59,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:29:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:29:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:29:59,663 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:29:59,663 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033231584] [2022-02-24 00:29:59,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033231584] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:29:59,663 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:29:59,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-24 00:29:59,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805519297] [2022-02-24 00:29:59,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:29:59,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-24 00:29:59,668 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:29:59,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-24 00:29:59,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-24 00:29:59,697 INFO L87 Difference]: Start difference. First operand has 295 states, 206 states have (on average 1.4271844660194175) internal successors, (294), 224 states have internal predecessors, (294), 61 states have call successors, (61), 26 states have call predecessors, (61), 26 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-24 00:30:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:00,553 INFO L93 Difference]: Finished difference Result 576 states and 845 transitions. [2022-02-24 00:30:00,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 00:30:00,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-24 00:30:00,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:00,572 INFO L225 Difference]: With dead ends: 576 [2022-02-24 00:30:00,573 INFO L226 Difference]: Without dead ends: 326 [2022-02-24 00:30:00,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-24 00:30:00,583 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 234 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:00,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 597 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-24 00:30:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-02-24 00:30:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2022-02-24 00:30:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 201 states have (on average 1.373134328358209) internal successors, (276), 217 states have internal predecessors, (276), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-02-24 00:30:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2022-02-24 00:30:00,661 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2022-02-24 00:30:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:00,662 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2022-02-24 00:30:00,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-24 00:30:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2022-02-24 00:30:00,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-24 00:30:00,663 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:00,663 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:00,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-24 00:30:00,664 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:00,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:00,665 INFO L85 PathProgramCache]: Analyzing trace with hash 690648180, now seen corresponding path program 1 times [2022-02-24 00:30:00,665 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:00,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066194853] [2022-02-24 00:30:00,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:00,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:00,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:00,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:00,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:00,836 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:00,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066194853] [2022-02-24 00:30:00,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066194853] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:00,836 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:00,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 00:30:00,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486818112] [2022-02-24 00:30:00,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:00,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 00:30:00,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:00,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 00:30:00,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-24 00:30:00,839 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 00:30:02,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:02,272 INFO L93 Difference]: Finished difference Result 690 states and 962 transitions. [2022-02-24 00:30:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 00:30:02,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-02-24 00:30:02,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:02,280 INFO L225 Difference]: With dead ends: 690 [2022-02-24 00:30:02,280 INFO L226 Difference]: Without dead ends: 507 [2022-02-24 00:30:02,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:30:02,286 INFO L933 BasicCegarLoop]: 490 mSDtfsCounter, 431 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:02,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [433 Valid, 683 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-24 00:30:02,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-02-24 00:30:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 440. [2022-02-24 00:30:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 318 states have (on average 1.3459119496855345) internal successors, (428), 329 states have internal predecessors, (428), 80 states have call successors, (80), 37 states have call predecessors, (80), 41 states have return successors, (100), 77 states have call predecessors, (100), 68 states have call successors, (100) [2022-02-24 00:30:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 608 transitions. [2022-02-24 00:30:02,328 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 608 transitions. Word has length 25 [2022-02-24 00:30:02,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:02,328 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 608 transitions. [2022-02-24 00:30:02,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 00:30:02,328 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 608 transitions. [2022-02-24 00:30:02,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-24 00:30:02,329 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:02,329 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:02,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-24 00:30:02,330 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:02,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:02,330 INFO L85 PathProgramCache]: Analyzing trace with hash 543429165, now seen corresponding path program 1 times [2022-02-24 00:30:02,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:02,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720698659] [2022-02-24 00:30:02,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:02,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:02,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:02,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:02,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:02,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:02,498 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:02,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720698659] [2022-02-24 00:30:02,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720698659] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:02,498 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:02,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 00:30:02,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132529354] [2022-02-24 00:30:02,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:02,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 00:30:02,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:02,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 00:30:02,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-24 00:30:02,500 INFO L87 Difference]: Start difference. First operand 440 states and 608 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 00:30:03,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:03,480 INFO L93 Difference]: Finished difference Result 1013 states and 1458 transitions. [2022-02-24 00:30:03,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 00:30:03,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-02-24 00:30:03,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:03,485 INFO L225 Difference]: With dead ends: 1013 [2022-02-24 00:30:03,485 INFO L226 Difference]: Without dead ends: 690 [2022-02-24 00:30:03,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:30:03,487 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 390 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:03,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 587 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-24 00:30:03,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-02-24 00:30:03,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 618. [2022-02-24 00:30:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 455 states have (on average 1.3560439560439561) internal successors, (617), 466 states have internal predecessors, (617), 109 states have call successors, (109), 49 states have call predecessors, (109), 53 states have return successors, (162), 105 states have call predecessors, (162), 98 states have call successors, (162) [2022-02-24 00:30:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 888 transitions. [2022-02-24 00:30:03,518 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 888 transitions. Word has length 31 [2022-02-24 00:30:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:03,518 INFO L470 AbstractCegarLoop]: Abstraction has 618 states and 888 transitions. [2022-02-24 00:30:03,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 00:30:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 888 transitions. [2022-02-24 00:30:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-24 00:30:03,520 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:03,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:03,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-24 00:30:03,521 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:03,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:03,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1394943520, now seen corresponding path program 1 times [2022-02-24 00:30:03,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:03,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081702697] [2022-02-24 00:30:03,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:03,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:03,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:03,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:03,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:03,641 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:03,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081702697] [2022-02-24 00:30:03,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081702697] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:03,641 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:03,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 00:30:03,641 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406288740] [2022-02-24 00:30:03,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:03,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 00:30:03,642 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:03,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 00:30:03,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-24 00:30:03,643 INFO L87 Difference]: Start difference. First operand 618 states and 888 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 00:30:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:04,254 INFO L93 Difference]: Finished difference Result 665 states and 952 transitions. [2022-02-24 00:30:04,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 00:30:04,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-02-24 00:30:04,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:04,258 INFO L225 Difference]: With dead ends: 665 [2022-02-24 00:30:04,258 INFO L226 Difference]: Without dead ends: 661 [2022-02-24 00:30:04,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-24 00:30:04,260 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 224 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:04,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 589 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 00:30:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-02-24 00:30:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2022-02-24 00:30:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 466 states have (on average 1.354077253218884) internal successors, (631), 475 states have internal predecessors, (631), 108 states have call successors, (108), 50 states have call predecessors, (108), 53 states have return successors, (162), 105 states have call predecessors, (162), 98 states have call successors, (162) [2022-02-24 00:30:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 901 transitions. [2022-02-24 00:30:04,301 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 901 transitions. Word has length 36 [2022-02-24 00:30:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:04,301 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 901 transitions. [2022-02-24 00:30:04,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 00:30:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 901 transitions. [2022-02-24 00:30:04,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-24 00:30:04,309 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:04,309 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:04,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-24 00:30:04,309 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:04,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:04,309 INFO L85 PathProgramCache]: Analyzing trace with hash -455202915, now seen corresponding path program 1 times [2022-02-24 00:30:04,310 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:04,310 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538323727] [2022-02-24 00:30:04,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:04,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:04,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:04,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:04,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:04,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-24 00:30:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:04,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:04,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:04,448 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:04,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538323727] [2022-02-24 00:30:04,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538323727] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:04,449 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:04,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 00:30:04,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850194901] [2022-02-24 00:30:04,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:04,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 00:30:04,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:04,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 00:30:04,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:30:04,451 INFO L87 Difference]: Start difference. First operand 628 states and 901 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:05,279 INFO L93 Difference]: Finished difference Result 710 states and 1007 transitions. [2022-02-24 00:30:05,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-24 00:30:05,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 39 [2022-02-24 00:30:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:05,284 INFO L225 Difference]: With dead ends: 710 [2022-02-24 00:30:05,284 INFO L226 Difference]: Without dead ends: 705 [2022-02-24 00:30:05,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-24 00:30:05,286 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 182 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:05,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 710 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-24 00:30:05,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-02-24 00:30:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2022-02-24 00:30:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.3504098360655739) internal successors, (659), 502 states have internal predecessors, (659), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2022-02-24 00:30:05,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 937 transitions. [2022-02-24 00:30:05,314 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 937 transitions. Word has length 39 [2022-02-24 00:30:05,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:05,314 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 937 transitions. [2022-02-24 00:30:05,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:05,314 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 937 transitions. [2022-02-24 00:30:05,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-24 00:30:05,315 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:05,315 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:05,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-24 00:30:05,315 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:05,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:05,316 INFO L85 PathProgramCache]: Analyzing trace with hash -454217859, now seen corresponding path program 1 times [2022-02-24 00:30:05,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:05,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790274601] [2022-02-24 00:30:05,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:05,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:05,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:05,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:05,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:05,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-24 00:30:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:05,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:05,497 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:05,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790274601] [2022-02-24 00:30:05,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790274601] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:05,498 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:05,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:30:05,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222046487] [2022-02-24 00:30:05,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:05,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:30:05,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:05,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:30:05,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:30:05,499 INFO L87 Difference]: Start difference. First operand 658 states and 937 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-24 00:30:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:06,570 INFO L93 Difference]: Finished difference Result 713 states and 1009 transitions. [2022-02-24 00:30:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-24 00:30:06,571 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-02-24 00:30:06,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:06,574 INFO L225 Difference]: With dead ends: 713 [2022-02-24 00:30:06,574 INFO L226 Difference]: Without dead ends: 705 [2022-02-24 00:30:06,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-02-24 00:30:06,575 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 599 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:06,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [608 Valid, 705 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-24 00:30:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-02-24 00:30:06,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2022-02-24 00:30:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.348360655737705) internal successors, (658), 502 states have internal predecessors, (658), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2022-02-24 00:30:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 936 transitions. [2022-02-24 00:30:06,605 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 936 transitions. Word has length 39 [2022-02-24 00:30:06,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:06,606 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 936 transitions. [2022-02-24 00:30:06,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-24 00:30:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 936 transitions. [2022-02-24 00:30:06,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-24 00:30:06,607 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:06,607 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:06,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-24 00:30:06,607 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:06,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1225775968, now seen corresponding path program 1 times [2022-02-24 00:30:06,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:06,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800266140] [2022-02-24 00:30:06,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:06,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:06,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:06,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:06,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:06,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-24 00:30:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:06,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:06,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:06,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800266140] [2022-02-24 00:30:06,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800266140] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:06,831 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:06,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:30:06,832 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520053088] [2022-02-24 00:30:06,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:06,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:30:06,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:06,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:30:06,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:30:06,832 INFO L87 Difference]: Start difference. First operand 658 states and 936 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-24 00:30:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:08,112 INFO L93 Difference]: Finished difference Result 713 states and 1008 transitions. [2022-02-24 00:30:08,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-24 00:30:08,112 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-02-24 00:30:08,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:08,117 INFO L225 Difference]: With dead ends: 713 [2022-02-24 00:30:08,117 INFO L226 Difference]: Without dead ends: 705 [2022-02-24 00:30:08,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-02-24 00:30:08,120 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 836 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:08,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [845 Valid, 859 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-24 00:30:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-02-24 00:30:08,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2022-02-24 00:30:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.346311475409836) internal successors, (657), 502 states have internal predecessors, (657), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2022-02-24 00:30:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 935 transitions. [2022-02-24 00:30:08,154 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 935 transitions. Word has length 40 [2022-02-24 00:30:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:08,154 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 935 transitions. [2022-02-24 00:30:08,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-24 00:30:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 935 transitions. [2022-02-24 00:30:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-24 00:30:08,156 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:08,156 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:08,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-24 00:30:08,156 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash 636808681, now seen corresponding path program 1 times [2022-02-24 00:30:08,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:08,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198218589] [2022-02-24 00:30:08,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:08,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:08,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:08,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:08,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:08,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-24 00:30:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:08,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:08,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:08,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198218589] [2022-02-24 00:30:08,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198218589] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:08,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:08,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 00:30:08,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151002964] [2022-02-24 00:30:08,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:08,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 00:30:08,284 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:08,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 00:30:08,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:30:08,285 INFO L87 Difference]: Start difference. First operand 658 states and 935 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:09,264 INFO L93 Difference]: Finished difference Result 1215 states and 1783 transitions. [2022-02-24 00:30:09,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 00:30:09,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2022-02-24 00:30:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:09,272 INFO L225 Difference]: With dead ends: 1215 [2022-02-24 00:30:09,272 INFO L226 Difference]: Without dead ends: 1186 [2022-02-24 00:30:09,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-02-24 00:30:09,273 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 696 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:09,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [701 Valid, 822 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-24 00:30:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-02-24 00:30:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1085. [2022-02-24 00:30:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 817 states have (on average 1.3635250917992656) internal successors, (1114), 835 states have internal predecessors, (1114), 173 states have call successors, (173), 79 states have call predecessors, (173), 94 states have return successors, (315), 175 states have call predecessors, (315), 163 states have call successors, (315) [2022-02-24 00:30:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1602 transitions. [2022-02-24 00:30:09,349 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1602 transitions. Word has length 41 [2022-02-24 00:30:09,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:09,351 INFO L470 AbstractCegarLoop]: Abstraction has 1085 states and 1602 transitions. [2022-02-24 00:30:09,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1602 transitions. [2022-02-24 00:30:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-24 00:30:09,353 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:09,353 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:09,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-24 00:30:09,354 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:09,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:09,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1732782333, now seen corresponding path program 1 times [2022-02-24 00:30:09,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:09,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404141768] [2022-02-24 00:30:09,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:09,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:09,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:09,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:09,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-24 00:30:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:09,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:09,480 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:09,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404141768] [2022-02-24 00:30:09,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404141768] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:09,480 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:09,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 00:30:09,480 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273310815] [2022-02-24 00:30:09,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:09,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 00:30:09,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:09,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 00:30:09,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-24 00:30:09,482 INFO L87 Difference]: Start difference. First operand 1085 states and 1602 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:10,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:10,265 INFO L93 Difference]: Finished difference Result 1170 states and 1724 transitions. [2022-02-24 00:30:10,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 00:30:10,265 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2022-02-24 00:30:10,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:10,271 INFO L225 Difference]: With dead ends: 1170 [2022-02-24 00:30:10,271 INFO L226 Difference]: Without dead ends: 1148 [2022-02-24 00:30:10,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-24 00:30:10,274 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 323 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:10,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 1132 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-24 00:30:10,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2022-02-24 00:30:10,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1078. [2022-02-24 00:30:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 813 states have (on average 1.3640836408364083) internal successors, (1109), 831 states have internal predecessors, (1109), 171 states have call successors, (171), 78 states have call predecessors, (171), 93 states have return successors, (313), 173 states have call predecessors, (313), 161 states have call successors, (313) [2022-02-24 00:30:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1593 transitions. [2022-02-24 00:30:10,333 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1593 transitions. Word has length 42 [2022-02-24 00:30:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:10,333 INFO L470 AbstractCegarLoop]: Abstraction has 1078 states and 1593 transitions. [2022-02-24 00:30:10,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1593 transitions. [2022-02-24 00:30:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-24 00:30:10,334 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:10,334 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:10,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-24 00:30:10,334 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:10,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1415168827, now seen corresponding path program 1 times [2022-02-24 00:30:10,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:10,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14438882] [2022-02-24 00:30:10,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:10,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:10,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:10,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:10,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:10,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:10,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14438882] [2022-02-24 00:30:10,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14438882] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:10,435 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:10,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 00:30:10,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639214608] [2022-02-24 00:30:10,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:10,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 00:30:10,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:10,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 00:30:10,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-24 00:30:10,436 INFO L87 Difference]: Start difference. First operand 1078 states and 1593 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 00:30:10,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:10,960 INFO L93 Difference]: Finished difference Result 1507 states and 2275 transitions. [2022-02-24 00:30:10,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 00:30:10,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-02-24 00:30:10,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:10,964 INFO L225 Difference]: With dead ends: 1507 [2022-02-24 00:30:10,964 INFO L226 Difference]: Without dead ends: 599 [2022-02-24 00:30:10,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:30:10,971 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 444 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:10,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 339 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-24 00:30:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-02-24 00:30:10,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 598. [2022-02-24 00:30:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 443 states have (on average 1.327313769751693) internal successors, (588), 455 states have internal predecessors, (588), 102 states have call successors, (102), 47 states have call predecessors, (102), 52 states have return successors, (160), 98 states have call predecessors, (160), 94 states have call successors, (160) [2022-02-24 00:30:11,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 850 transitions. [2022-02-24 00:30:11,002 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 850 transitions. Word has length 45 [2022-02-24 00:30:11,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:11,003 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 850 transitions. [2022-02-24 00:30:11,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 00:30:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 850 transitions. [2022-02-24 00:30:11,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-24 00:30:11,004 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:11,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:11,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-24 00:30:11,004 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:11,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:11,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1870236117, now seen corresponding path program 1 times [2022-02-24 00:30:11,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:11,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187178826] [2022-02-24 00:30:11,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:11,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:11,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:11,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:11,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:11,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-24 00:30:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:11,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:30:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:11,171 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:11,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187178826] [2022-02-24 00:30:11,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187178826] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:11,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:11,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-24 00:30:11,171 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295006212] [2022-02-24 00:30:11,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:11,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-24 00:30:11,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:11,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-24 00:30:11,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-24 00:30:11,172 INFO L87 Difference]: Start difference. First operand 598 states and 850 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-24 00:30:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:11,885 INFO L93 Difference]: Finished difference Result 633 states and 893 transitions. [2022-02-24 00:30:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:30:11,886 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-02-24 00:30:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:11,893 INFO L225 Difference]: With dead ends: 633 [2022-02-24 00:30:11,893 INFO L226 Difference]: Without dead ends: 608 [2022-02-24 00:30:11,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-02-24 00:30:11,894 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 269 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:11,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 1154 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 00:30:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-02-24 00:30:11,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 596. [2022-02-24 00:30:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.3235294117647058) internal successors, (585), 454 states have internal predecessors, (585), 101 states have call successors, (101), 47 states have call predecessors, (101), 52 states have return successors, (159), 97 states have call predecessors, (159), 93 states have call successors, (159) [2022-02-24 00:30:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 845 transitions. [2022-02-24 00:30:11,942 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 845 transitions. Word has length 46 [2022-02-24 00:30:11,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:11,942 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 845 transitions. [2022-02-24 00:30:11,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-24 00:30:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 845 transitions. [2022-02-24 00:30:11,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-24 00:30:11,943 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:11,943 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:11,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-24 00:30:11,944 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:11,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:11,944 INFO L85 PathProgramCache]: Analyzing trace with hash -961233056, now seen corresponding path program 1 times [2022-02-24 00:30:11,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:11,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131454803] [2022-02-24 00:30:11,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:11,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:12,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:12,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:12,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:12,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-24 00:30:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:12,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:30:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:12,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:12,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131454803] [2022-02-24 00:30:12,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131454803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:12,126 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:12,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 00:30:12,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871216219] [2022-02-24 00:30:12,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:12,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 00:30:12,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:12,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 00:30:12,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:30:12,127 INFO L87 Difference]: Start difference. First operand 596 states and 845 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:12,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:12,835 INFO L93 Difference]: Finished difference Result 834 states and 1234 transitions. [2022-02-24 00:30:12,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 00:30:12,836 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2022-02-24 00:30:12,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:12,839 INFO L225 Difference]: With dead ends: 834 [2022-02-24 00:30:12,839 INFO L226 Difference]: Without dead ends: 826 [2022-02-24 00:30:12,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-02-24 00:30:12,840 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 615 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:12,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [620 Valid, 662 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 00:30:12,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-02-24 00:30:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 665. [2022-02-24 00:30:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 495 states have (on average 1.3232323232323233) internal successors, (655), 508 states have internal predecessors, (655), 109 states have call successors, (109), 50 states have call predecessors, (109), 60 states have return successors, (184), 110 states have call predecessors, (184), 101 states have call successors, (184) [2022-02-24 00:30:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 948 transitions. [2022-02-24 00:30:12,875 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 948 transitions. Word has length 46 [2022-02-24 00:30:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:12,875 INFO L470 AbstractCegarLoop]: Abstraction has 665 states and 948 transitions. [2022-02-24 00:30:12,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:12,875 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 948 transitions. [2022-02-24 00:30:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-24 00:30:12,876 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:12,876 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:12,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-24 00:30:12,876 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:12,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:12,877 INFO L85 PathProgramCache]: Analyzing trace with hash -91170375, now seen corresponding path program 1 times [2022-02-24 00:30:12,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:12,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382080892] [2022-02-24 00:30:12,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:12,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:12,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:12,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:12,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:12,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-24 00:30:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:12,998 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:12,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382080892] [2022-02-24 00:30:12,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382080892] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:12,998 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:12,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 00:30:12,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110790164] [2022-02-24 00:30:12,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:12,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 00:30:12,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:12,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 00:30:12,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:30:12,999 INFO L87 Difference]: Start difference. First operand 665 states and 948 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-24 00:30:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:13,572 INFO L93 Difference]: Finished difference Result 739 states and 1021 transitions. [2022-02-24 00:30:13,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 00:30:13,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2022-02-24 00:30:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:13,575 INFO L225 Difference]: With dead ends: 739 [2022-02-24 00:30:13,575 INFO L226 Difference]: Without dead ends: 462 [2022-02-24 00:30:13,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:30:13,576 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 471 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:13,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [478 Valid, 650 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 00:30:13,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-02-24 00:30:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 441. [2022-02-24 00:30:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 327 states have (on average 1.27217125382263) internal successors, (416), 338 states have internal predecessors, (416), 69 states have call successors, (69), 38 states have call predecessors, (69), 44 states have return successors, (93), 68 states have call predecessors, (93), 61 states have call successors, (93) [2022-02-24 00:30:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 578 transitions. [2022-02-24 00:30:13,598 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 578 transitions. Word has length 49 [2022-02-24 00:30:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:13,599 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 578 transitions. [2022-02-24 00:30:13,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-24 00:30:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 578 transitions. [2022-02-24 00:30:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-24 00:30:13,600 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:13,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:13,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-24 00:30:13,600 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:13,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:13,601 INFO L85 PathProgramCache]: Analyzing trace with hash 298099852, now seen corresponding path program 1 times [2022-02-24 00:30:13,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:13,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623611175] [2022-02-24 00:30:13,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:13,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:13,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:13,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:13,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:13,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-24 00:30:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:13,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:30:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:13,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:13,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623611175] [2022-02-24 00:30:13,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623611175] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:13,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:13,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-24 00:30:13,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397271690] [2022-02-24 00:30:13,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:13,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 00:30:13,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:13,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 00:30:13,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-24 00:30:13,768 INFO L87 Difference]: Start difference. First operand 441 states and 578 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:14,430 INFO L93 Difference]: Finished difference Result 457 states and 597 transitions. [2022-02-24 00:30:14,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-24 00:30:14,430 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-02-24 00:30:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:14,432 INFO L225 Difference]: With dead ends: 457 [2022-02-24 00:30:14,432 INFO L226 Difference]: Without dead ends: 453 [2022-02-24 00:30:14,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-02-24 00:30:14,433 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 164 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:14,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 1464 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 00:30:14,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-02-24 00:30:14,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2022-02-24 00:30:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 334 states have (on average 1.2724550898203593) internal successors, (425), 346 states have internal predecessors, (425), 70 states have call successors, (70), 38 states have call predecessors, (70), 44 states have return successors, (94), 69 states have call predecessors, (94), 62 states have call successors, (94) [2022-02-24 00:30:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2022-02-24 00:30:14,455 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2022-02-24 00:30:14,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:14,456 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2022-02-24 00:30:14,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2022-02-24 00:30:14,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-24 00:30:14,456 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:14,456 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:14,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-24 00:30:14,457 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:14,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:14,457 INFO L85 PathProgramCache]: Analyzing trace with hash 298068108, now seen corresponding path program 1 times [2022-02-24 00:30:14,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:14,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331600558] [2022-02-24 00:30:14,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:14,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:14,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:14,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:14,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:14,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-24 00:30:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:14,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:30:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:14,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:14,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331600558] [2022-02-24 00:30:14,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331600558] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:14,658 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:14,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-24 00:30:14,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326940238] [2022-02-24 00:30:14,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:14,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 00:30:14,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:14,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 00:30:14,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-24 00:30:14,659 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:15,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:15,261 INFO L93 Difference]: Finished difference Result 780 states and 1069 transitions. [2022-02-24 00:30:15,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:30:15,261 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-02-24 00:30:15,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:15,263 INFO L225 Difference]: With dead ends: 780 [2022-02-24 00:30:15,263 INFO L226 Difference]: Without dead ends: 472 [2022-02-24 00:30:15,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-02-24 00:30:15,265 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 264 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:15,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 1475 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 00:30:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-02-24 00:30:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 459. [2022-02-24 00:30:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 343 states have (on average 1.2769679300291545) internal successors, (438), 356 states have internal predecessors, (438), 70 states have call successors, (70), 38 states have call predecessors, (70), 45 states have return successors, (96), 69 states have call predecessors, (96), 62 states have call successors, (96) [2022-02-24 00:30:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 604 transitions. [2022-02-24 00:30:15,291 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 604 transitions. Word has length 47 [2022-02-24 00:30:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:15,292 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 604 transitions. [2022-02-24 00:30:15,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2022-02-24 00:30:15,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-24 00:30:15,292 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:15,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:15,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-24 00:30:15,293 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:15,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:15,293 INFO L85 PathProgramCache]: Analyzing trace with hash -309998534, now seen corresponding path program 1 times [2022-02-24 00:30:15,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:15,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486226550] [2022-02-24 00:30:15,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:15,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:15,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:15,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:15,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:15,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-24 00:30:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:15,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:30:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:15,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:15,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486226550] [2022-02-24 00:30:15,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486226550] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:15,446 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:15,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 00:30:15,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895837194] [2022-02-24 00:30:15,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:15,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 00:30:15,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:15,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 00:30:15,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-24 00:30:15,447 INFO L87 Difference]: Start difference. First operand 459 states and 604 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-24 00:30:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:16,581 INFO L93 Difference]: Finished difference Result 594 states and 812 transitions. [2022-02-24 00:30:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-24 00:30:16,581 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2022-02-24 00:30:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:16,583 INFO L225 Difference]: With dead ends: 594 [2022-02-24 00:30:16,583 INFO L226 Difference]: Without dead ends: 575 [2022-02-24 00:30:16,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-02-24 00:30:16,584 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 1028 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:16,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1042 Valid, 772 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-24 00:30:16,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-02-24 00:30:16,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 444. [2022-02-24 00:30:16,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 332 states have (on average 1.2771084337349397) internal successors, (424), 343 states have internal predecessors, (424), 68 states have call successors, (68), 38 states have call predecessors, (68), 43 states have return successors, (91), 66 states have call predecessors, (91), 60 states have call successors, (91) [2022-02-24 00:30:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 583 transitions. [2022-02-24 00:30:16,612 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 583 transitions. Word has length 48 [2022-02-24 00:30:16,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:16,612 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 583 transitions. [2022-02-24 00:30:16,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-24 00:30:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 583 transitions. [2022-02-24 00:30:16,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-24 00:30:16,613 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:16,613 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:16,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-24 00:30:16,614 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:16,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash 328516868, now seen corresponding path program 1 times [2022-02-24 00:30:16,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:16,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635438825] [2022-02-24 00:30:16,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:16,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:16,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:16,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:16,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:16,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-24 00:30:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:16,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:16,776 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:16,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635438825] [2022-02-24 00:30:16,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635438825] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:16,776 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:16,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:30:16,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326313983] [2022-02-24 00:30:16,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:16,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:30:16,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:16,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:30:16,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:30:16,777 INFO L87 Difference]: Start difference. First operand 444 states and 583 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:17,552 INFO L93 Difference]: Finished difference Result 458 states and 599 transitions. [2022-02-24 00:30:17,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-24 00:30:17,557 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2022-02-24 00:30:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:17,559 INFO L225 Difference]: With dead ends: 458 [2022-02-24 00:30:17,573 INFO L226 Difference]: Without dead ends: 427 [2022-02-24 00:30:17,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-24 00:30:17,574 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 89 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:17,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 1517 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-24 00:30:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-02-24 00:30:17,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2022-02-24 00:30:17,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 318 states have (on average 1.279874213836478) internal successors, (407), 330 states have internal predecessors, (407), 66 states have call successors, (66), 36 states have call predecessors, (66), 42 states have return successors, (89), 64 states have call predecessors, (89), 58 states have call successors, (89) [2022-02-24 00:30:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 562 transitions. [2022-02-24 00:30:17,601 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 562 transitions. Word has length 49 [2022-02-24 00:30:17,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:17,601 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 562 transitions. [2022-02-24 00:30:17,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 562 transitions. [2022-02-24 00:30:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-24 00:30:17,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:17,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:17,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-24 00:30:17,602 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:17,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:17,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1720991068, now seen corresponding path program 1 times [2022-02-24 00:30:17,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:17,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598366356] [2022-02-24 00:30:17,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:17,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:17,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:17,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:17,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:17,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-24 00:30:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:17,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-24 00:30:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:17,756 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:17,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598366356] [2022-02-24 00:30:17,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598366356] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:17,756 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:17,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-24 00:30:17,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094465630] [2022-02-24 00:30:17,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:17,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-24 00:30:17,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:17,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-24 00:30:17,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-24 00:30:17,757 INFO L87 Difference]: Start difference. First operand 427 states and 562 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-24 00:30:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:18,454 INFO L93 Difference]: Finished difference Result 456 states and 600 transitions. [2022-02-24 00:30:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-24 00:30:18,454 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-02-24 00:30:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:18,456 INFO L225 Difference]: With dead ends: 456 [2022-02-24 00:30:18,456 INFO L226 Difference]: Without dead ends: 423 [2022-02-24 00:30:18,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-02-24 00:30:18,457 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 244 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:18,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 1123 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 00:30:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-02-24 00:30:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 409. [2022-02-24 00:30:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 316 states have internal predecessors, (391), 64 states have call successors, (64), 34 states have call predecessors, (64), 40 states have return successors, (87), 62 states have call predecessors, (87), 56 states have call successors, (87) [2022-02-24 00:30:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 542 transitions. [2022-02-24 00:30:18,479 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 542 transitions. Word has length 50 [2022-02-24 00:30:18,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:18,479 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 542 transitions. [2022-02-24 00:30:18,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-24 00:30:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 542 transitions. [2022-02-24 00:30:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-24 00:30:18,480 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:18,480 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:18,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-24 00:30:18,480 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:18,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:18,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1090499838, now seen corresponding path program 1 times [2022-02-24 00:30:18,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:18,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25660811] [2022-02-24 00:30:18,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:18,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:18,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:18,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:18,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:18,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:30:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:18,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:18,591 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:18,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25660811] [2022-02-24 00:30:18,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25660811] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:18,591 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:18,591 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-24 00:30:18,591 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770183331] [2022-02-24 00:30:18,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:18,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-24 00:30:18,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-24 00:30:18,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-02-24 00:30:18,592 INFO L87 Difference]: Start difference. First operand 409 states and 542 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-24 00:30:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:20,297 INFO L93 Difference]: Finished difference Result 634 states and 905 transitions. [2022-02-24 00:30:20,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-24 00:30:20,297 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-02-24 00:30:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:20,300 INFO L225 Difference]: With dead ends: 634 [2022-02-24 00:30:20,300 INFO L226 Difference]: Without dead ends: 600 [2022-02-24 00:30:20,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2022-02-24 00:30:20,301 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 618 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 2499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:20,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 1412 Invalid, 2499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2230 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-24 00:30:20,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-02-24 00:30:20,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 534. [2022-02-24 00:30:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 399 states have (on average 1.3433583959899749) internal successors, (536), 410 states have internal predecessors, (536), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2022-02-24 00:30:20,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 769 transitions. [2022-02-24 00:30:20,333 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 769 transitions. Word has length 50 [2022-02-24 00:30:20,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:20,333 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 769 transitions. [2022-02-24 00:30:20,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-24 00:30:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 769 transitions. [2022-02-24 00:30:20,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-24 00:30:20,334 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:20,334 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:20,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-24 00:30:20,334 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:20,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:20,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1506717387, now seen corresponding path program 1 times [2022-02-24 00:30:20,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:20,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115144074] [2022-02-24 00:30:20,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:20,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:20,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:20,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:20,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:20,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:30:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:20,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:20,455 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:20,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115144074] [2022-02-24 00:30:20,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115144074] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:20,455 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:20,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 00:30:20,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064217251] [2022-02-24 00:30:20,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:20,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 00:30:20,456 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:20,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 00:30:20,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-24 00:30:20,457 INFO L87 Difference]: Start difference. First operand 534 states and 769 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-24 00:30:21,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:21,181 INFO L93 Difference]: Finished difference Result 587 states and 833 transitions. [2022-02-24 00:30:21,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-24 00:30:21,182 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-02-24 00:30:21,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:21,184 INFO L225 Difference]: With dead ends: 587 [2022-02-24 00:30:21,184 INFO L226 Difference]: Without dead ends: 555 [2022-02-24 00:30:21,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-02-24 00:30:21,185 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 349 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:21,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 742 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 00:30:21,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-02-24 00:30:21,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 537. [2022-02-24 00:30:21,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 402 states have (on average 1.3432835820895523) internal successors, (540), 413 states have internal predecessors, (540), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2022-02-24 00:30:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 773 transitions. [2022-02-24 00:30:21,216 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 773 transitions. Word has length 51 [2022-02-24 00:30:21,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:21,216 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 773 transitions. [2022-02-24 00:30:21,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-24 00:30:21,216 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 773 transitions. [2022-02-24 00:30:21,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-24 00:30:21,216 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:21,217 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:21,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-24 00:30:21,217 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:21,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:21,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1791177556, now seen corresponding path program 1 times [2022-02-24 00:30:21,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:21,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742604332] [2022-02-24 00:30:21,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:21,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:21,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:21,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:21,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:21,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:30:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:21,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:21,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:21,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742604332] [2022-02-24 00:30:21,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742604332] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:21,342 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:21,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:30:21,342 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956303600] [2022-02-24 00:30:21,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:21,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:30:21,344 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:21,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:30:21,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:30:21,344 INFO L87 Difference]: Start difference. First operand 537 states and 773 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-24 00:30:22,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:22,080 INFO L93 Difference]: Finished difference Result 670 states and 993 transitions. [2022-02-24 00:30:22,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:30:22,081 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2022-02-24 00:30:22,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:22,083 INFO L225 Difference]: With dead ends: 670 [2022-02-24 00:30:22,083 INFO L226 Difference]: Without dead ends: 624 [2022-02-24 00:30:22,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2022-02-24 00:30:22,084 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 536 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:22,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [543 Valid, 859 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 00:30:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-02-24 00:30:22,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 529. [2022-02-24 00:30:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 394 states have (on average 1.3350253807106598) internal successors, (526), 405 states have internal predecessors, (526), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2022-02-24 00:30:22,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 759 transitions. [2022-02-24 00:30:22,128 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 759 transitions. Word has length 51 [2022-02-24 00:30:22,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:22,128 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 759 transitions. [2022-02-24 00:30:22,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-24 00:30:22,128 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 759 transitions. [2022-02-24 00:30:22,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-24 00:30:22,129 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:22,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:22,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-24 00:30:22,129 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:22,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash -50366668, now seen corresponding path program 1 times [2022-02-24 00:30:22,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:22,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395882658] [2022-02-24 00:30:22,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:22,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:22,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:22,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:22,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:22,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:30:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:22,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:22,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:22,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395882658] [2022-02-24 00:30:22,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395882658] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:22,218 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:22,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-24 00:30:22,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573535527] [2022-02-24 00:30:22,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:22,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-24 00:30:22,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:22,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-24 00:30:22,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-24 00:30:22,219 INFO L87 Difference]: Start difference. First operand 529 states and 759 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:23,232 INFO L93 Difference]: Finished difference Result 714 states and 1095 transitions. [2022-02-24 00:30:23,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-24 00:30:23,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2022-02-24 00:30:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:23,237 INFO L225 Difference]: With dead ends: 714 [2022-02-24 00:30:23,237 INFO L226 Difference]: Without dead ends: 701 [2022-02-24 00:30:23,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-24 00:30:23,237 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 241 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:23,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 762 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-24 00:30:23,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2022-02-24 00:30:23,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 524. [2022-02-24 00:30:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 390 states have (on average 1.3307692307692307) internal successors, (519), 400 states have internal predecessors, (519), 91 states have call successors, (91), 37 states have call predecessors, (91), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2022-02-24 00:30:23,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 751 transitions. [2022-02-24 00:30:23,272 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 751 transitions. Word has length 51 [2022-02-24 00:30:23,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:23,272 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 751 transitions. [2022-02-24 00:30:23,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:23,272 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 751 transitions. [2022-02-24 00:30:23,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-24 00:30:23,273 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:23,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:23,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-24 00:30:23,273 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:23,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:23,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1529813192, now seen corresponding path program 1 times [2022-02-24 00:30:23,273 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:23,273 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855041650] [2022-02-24 00:30:23,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:23,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:23,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:23,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:23,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:23,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:30:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:23,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:23,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:23,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855041650] [2022-02-24 00:30:23,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855041650] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:23,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:23,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:30:23,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343356344] [2022-02-24 00:30:23,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:23,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:30:23,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:23,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:30:23,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:30:23,396 INFO L87 Difference]: Start difference. First operand 524 states and 751 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:24,142 INFO L93 Difference]: Finished difference Result 547 states and 781 transitions. [2022-02-24 00:30:24,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 00:30:24,143 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2022-02-24 00:30:24,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:24,145 INFO L225 Difference]: With dead ends: 547 [2022-02-24 00:30:24,145 INFO L226 Difference]: Without dead ends: 543 [2022-02-24 00:30:24,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-24 00:30:24,145 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 76 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:24,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 1340 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-24 00:30:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-02-24 00:30:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 531. [2022-02-24 00:30:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 396 states have (on average 1.3282828282828283) internal successors, (526), 407 states have internal predecessors, (526), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2022-02-24 00:30:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 760 transitions. [2022-02-24 00:30:24,179 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 760 transitions. Word has length 52 [2022-02-24 00:30:24,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:24,179 INFO L470 AbstractCegarLoop]: Abstraction has 531 states and 760 transitions. [2022-02-24 00:30:24,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:24,179 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 760 transitions. [2022-02-24 00:30:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-24 00:30:24,180 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:24,180 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:24,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-24 00:30:24,180 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1529844936, now seen corresponding path program 1 times [2022-02-24 00:30:24,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:24,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780824635] [2022-02-24 00:30:24,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:24,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:24,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:24,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:24,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:24,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:30:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:24,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:24,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:24,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780824635] [2022-02-24 00:30:24,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780824635] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:24,320 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:24,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:30:24,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728966407] [2022-02-24 00:30:24,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:24,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:30:24,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:24,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:30:24,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:30:24,321 INFO L87 Difference]: Start difference. First operand 531 states and 760 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:24,916 INFO L93 Difference]: Finished difference Result 562 states and 797 transitions. [2022-02-24 00:30:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-24 00:30:24,916 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2022-02-24 00:30:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:24,918 INFO L225 Difference]: With dead ends: 562 [2022-02-24 00:30:24,918 INFO L226 Difference]: Without dead ends: 538 [2022-02-24 00:30:24,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-02-24 00:30:24,919 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 138 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:24,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 1429 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 00:30:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-02-24 00:30:24,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 530. [2022-02-24 00:30:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 395 states have (on average 1.3265822784810126) internal successors, (524), 406 states have internal predecessors, (524), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2022-02-24 00:30:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 758 transitions. [2022-02-24 00:30:24,952 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 758 transitions. Word has length 52 [2022-02-24 00:30:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:24,952 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 758 transitions. [2022-02-24 00:30:24,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-24 00:30:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 758 transitions. [2022-02-24 00:30:24,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-24 00:30:24,952 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:24,952 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:24,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-24 00:30:24,953 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:24,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:24,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1874017512, now seen corresponding path program 1 times [2022-02-24 00:30:24,953 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:24,953 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561322342] [2022-02-24 00:30:24,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:24,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:25,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:25,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:25,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:25,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-24 00:30:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:25,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:25,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-24 00:30:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:25,073 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:25,073 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561322342] [2022-02-24 00:30:25,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561322342] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:25,073 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:25,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 00:30:25,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127494186] [2022-02-24 00:30:25,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:25,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 00:30:25,074 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:25,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 00:30:25,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:30:25,074 INFO L87 Difference]: Start difference. First operand 530 states and 758 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-24 00:30:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:25,598 INFO L93 Difference]: Finished difference Result 955 states and 1439 transitions. [2022-02-24 00:30:25,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 00:30:25,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-02-24 00:30:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:25,601 INFO L225 Difference]: With dead ends: 955 [2022-02-24 00:30:25,601 INFO L226 Difference]: Without dead ends: 549 [2022-02-24 00:30:25,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:30:25,603 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 188 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:25,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 704 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-24 00:30:25,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-02-24 00:30:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 529. [2022-02-24 00:30:25,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 394 states have (on average 1.3197969543147208) internal successors, (520), 405 states have internal predecessors, (520), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2022-02-24 00:30:25,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 754 transitions. [2022-02-24 00:30:25,653 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 754 transitions. Word has length 58 [2022-02-24 00:30:25,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:25,653 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 754 transitions. [2022-02-24 00:30:25,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-24 00:30:25,654 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 754 transitions. [2022-02-24 00:30:25,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-24 00:30:25,655 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:25,655 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:25,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-24 00:30:25,655 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:25,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:25,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2132872221, now seen corresponding path program 1 times [2022-02-24 00:30:25,655 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:25,655 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810933929] [2022-02-24 00:30:25,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:25,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:25,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:25,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:25,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:25,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:30:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:25,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:25,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:25,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810933929] [2022-02-24 00:30:25,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810933929] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:25,786 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:25,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-24 00:30:25,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794105462] [2022-02-24 00:30:25,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:25,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-24 00:30:25,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:25,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-24 00:30:25,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-24 00:30:25,788 INFO L87 Difference]: Start difference. First operand 529 states and 754 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-24 00:30:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:26,594 INFO L93 Difference]: Finished difference Result 675 states and 1000 transitions. [2022-02-24 00:30:26,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:30:26,595 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2022-02-24 00:30:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:26,597 INFO L225 Difference]: With dead ends: 675 [2022-02-24 00:30:26,597 INFO L226 Difference]: Without dead ends: 639 [2022-02-24 00:30:26,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-02-24 00:30:26,598 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 683 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:26,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [694 Valid, 736 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 00:30:26,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-02-24 00:30:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 560. [2022-02-24 00:30:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 415 states have (on average 1.344578313253012) internal successors, (558), 426 states have internal predecessors, (558), 101 states have call successors, (101), 37 states have call predecessors, (101), 43 states have return successors, (165), 98 states have call predecessors, (165), 94 states have call successors, (165) [2022-02-24 00:30:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 824 transitions. [2022-02-24 00:30:26,644 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 824 transitions. Word has length 53 [2022-02-24 00:30:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:26,644 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 824 transitions. [2022-02-24 00:30:26,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-24 00:30:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 824 transitions. [2022-02-24 00:30:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-24 00:30:26,645 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:26,645 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:26,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-24 00:30:26,645 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:26,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:26,645 INFO L85 PathProgramCache]: Analyzing trace with hash 983025775, now seen corresponding path program 1 times [2022-02-24 00:30:26,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:26,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258668622] [2022-02-24 00:30:26,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:26,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:26,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:26,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:26,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:26,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-24 00:30:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:26,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:26,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:26,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:26,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258668622] [2022-02-24 00:30:26,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258668622] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:26,843 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:26,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-24 00:30:26,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659225148] [2022-02-24 00:30:26,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:26,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 00:30:26,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:26,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 00:30:26,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-24 00:30:26,844 INFO L87 Difference]: Start difference. First operand 560 states and 824 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-24 00:30:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:27,423 INFO L93 Difference]: Finished difference Result 856 states and 1268 transitions. [2022-02-24 00:30:27,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 00:30:27,423 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-02-24 00:30:27,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:27,425 INFO L225 Difference]: With dead ends: 856 [2022-02-24 00:30:27,425 INFO L226 Difference]: Without dead ends: 390 [2022-02-24 00:30:27,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-02-24 00:30:27,428 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 164 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:27,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 1423 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 00:30:27,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-02-24 00:30:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 338. [2022-02-24 00:30:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 246 states have (on average 1.2560975609756098) internal successors, (309), 254 states have internal predecessors, (309), 59 states have call successors, (59), 31 states have call predecessors, (59), 32 states have return successors, (74), 54 states have call predecessors, (74), 53 states have call successors, (74) [2022-02-24 00:30:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2022-02-24 00:30:27,453 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 62 [2022-02-24 00:30:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:27,453 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2022-02-24 00:30:27,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-24 00:30:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2022-02-24 00:30:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-24 00:30:27,453 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:27,453 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:27,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-24 00:30:27,454 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:27,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:27,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1006609107, now seen corresponding path program 1 times [2022-02-24 00:30:27,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:27,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319557731] [2022-02-24 00:30:27,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:27,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:27,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:27,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:27,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:27,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:30:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:27,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:27,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:27,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:27,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:27,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319557731] [2022-02-24 00:30:27,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319557731] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:27,613 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:27,614 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-24 00:30:27,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195274169] [2022-02-24 00:30:27,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:27,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-24 00:30:27,614 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:27,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-24 00:30:27,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-02-24 00:30:27,614 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-24 00:30:28,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:28,103 INFO L93 Difference]: Finished difference Result 346 states and 454 transitions. [2022-02-24 00:30:28,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:30:28,104 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-02-24 00:30:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:28,105 INFO L225 Difference]: With dead ends: 346 [2022-02-24 00:30:28,105 INFO L226 Difference]: Without dead ends: 304 [2022-02-24 00:30:28,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-02-24 00:30:28,105 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 108 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:28,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 1448 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-24 00:30:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-02-24 00:30:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2022-02-24 00:30:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 214 states have (on average 1.2757009345794392) internal successors, (273), 220 states have internal predecessors, (273), 55 states have call successors, (55), 28 states have call predecessors, (55), 28 states have return successors, (70), 50 states have call predecessors, (70), 50 states have call successors, (70) [2022-02-24 00:30:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 398 transitions. [2022-02-24 00:30:28,139 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 398 transitions. Word has length 58 [2022-02-24 00:30:28,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:28,139 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 398 transitions. [2022-02-24 00:30:28,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-24 00:30:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 398 transitions. [2022-02-24 00:30:28,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-24 00:30:28,139 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:28,139 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:28,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-24 00:30:28,140 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:28,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:28,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2058307499, now seen corresponding path program 1 times [2022-02-24 00:30:28,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:28,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070764396] [2022-02-24 00:30:28,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:28,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:28,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:28,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:28,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:28,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-24 00:30:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:28,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:28,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:28,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:28,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:28,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070764396] [2022-02-24 00:30:28,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070764396] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:28,279 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:28,279 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:30:28,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767549123] [2022-02-24 00:30:28,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:28,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:30:28,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:28,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:30:28,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:30:28,281 INFO L87 Difference]: Start difference. First operand 298 states and 398 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-24 00:30:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:28,806 INFO L93 Difference]: Finished difference Result 576 states and 798 transitions. [2022-02-24 00:30:28,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:30:28,807 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2022-02-24 00:30:28,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:28,808 INFO L225 Difference]: With dead ends: 576 [2022-02-24 00:30:28,808 INFO L226 Difference]: Without dead ends: 316 [2022-02-24 00:30:28,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-02-24 00:30:28,809 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 287 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:28,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 782 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-24 00:30:28,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-02-24 00:30:28,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 298. [2022-02-24 00:30:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 214 states have (on average 1.266355140186916) internal successors, (271), 220 states have internal predecessors, (271), 55 states have call successors, (55), 28 states have call predecessors, (55), 28 states have return successors, (70), 50 states have call predecessors, (70), 50 states have call successors, (70) [2022-02-24 00:30:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 396 transitions. [2022-02-24 00:30:28,831 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 396 transitions. Word has length 67 [2022-02-24 00:30:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:28,831 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 396 transitions. [2022-02-24 00:30:28,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-24 00:30:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 396 transitions. [2022-02-24 00:30:28,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-24 00:30:28,832 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:28,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:28,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-24 00:30:28,832 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:28,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:28,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1216763617, now seen corresponding path program 1 times [2022-02-24 00:30:28,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:28,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285560148] [2022-02-24 00:30:28,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:28,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:28,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:28,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:28,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:28,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-24 00:30:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:28,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:28,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:28,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:28,968 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:28,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285560148] [2022-02-24 00:30:28,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285560148] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:28,968 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:28,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:30:28,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600062130] [2022-02-24 00:30:28,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:28,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:30:28,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:28,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:30:28,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:30:28,969 INFO L87 Difference]: Start difference. First operand 298 states and 396 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-24 00:30:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:29,292 INFO L93 Difference]: Finished difference Result 591 states and 822 transitions. [2022-02-24 00:30:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 00:30:29,293 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2022-02-24 00:30:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:29,294 INFO L225 Difference]: With dead ends: 591 [2022-02-24 00:30:29,294 INFO L226 Difference]: Without dead ends: 330 [2022-02-24 00:30:29,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-02-24 00:30:29,296 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 155 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:29,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 1096 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-24 00:30:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-02-24 00:30:29,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 303. [2022-02-24 00:30:29,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 218 states have (on average 1.261467889908257) internal successors, (275), 224 states have internal predecessors, (275), 55 states have call successors, (55), 28 states have call predecessors, (55), 29 states have return successors, (79), 51 states have call predecessors, (79), 50 states have call successors, (79) [2022-02-24 00:30:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 409 transitions. [2022-02-24 00:30:29,318 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 409 transitions. Word has length 68 [2022-02-24 00:30:29,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:29,318 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 409 transitions. [2022-02-24 00:30:29,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-24 00:30:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 409 transitions. [2022-02-24 00:30:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-24 00:30:29,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:29,319 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:29,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-24 00:30:29,319 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:29,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:29,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1023463232, now seen corresponding path program 1 times [2022-02-24 00:30:29,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:29,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701754690] [2022-02-24 00:30:29,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:29,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:29,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:29,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:29,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:29,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-24 00:30:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:29,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:29,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:29,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:29,443 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:29,443 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701754690] [2022-02-24 00:30:29,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701754690] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:29,443 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:29,443 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-24 00:30:29,443 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471376222] [2022-02-24 00:30:29,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:29,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-24 00:30:29,444 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:29,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-24 00:30:29,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-24 00:30:29,444 INFO L87 Difference]: Start difference. First operand 303 states and 409 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-24 00:30:29,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:29,777 INFO L93 Difference]: Finished difference Result 477 states and 678 transitions. [2022-02-24 00:30:29,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 00:30:29,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 70 [2022-02-24 00:30:29,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:29,780 INFO L225 Difference]: With dead ends: 477 [2022-02-24 00:30:29,780 INFO L226 Difference]: Without dead ends: 474 [2022-02-24 00:30:29,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:30:29,780 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 277 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:29,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 793 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-24 00:30:29,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-02-24 00:30:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 307. [2022-02-24 00:30:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 222 states have (on average 1.2657657657657657) internal successors, (281), 228 states have internal predecessors, (281), 55 states have call successors, (55), 28 states have call predecessors, (55), 29 states have return successors, (79), 51 states have call predecessors, (79), 50 states have call successors, (79) [2022-02-24 00:30:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 415 transitions. [2022-02-24 00:30:29,805 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 415 transitions. Word has length 70 [2022-02-24 00:30:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:29,805 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 415 transitions. [2022-02-24 00:30:29,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-24 00:30:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 415 transitions. [2022-02-24 00:30:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-24 00:30:29,806 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:29,806 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:29,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-24 00:30:29,806 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:29,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:29,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1693422670, now seen corresponding path program 1 times [2022-02-24 00:30:29,806 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:29,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404207453] [2022-02-24 00:30:29,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:29,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:29,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:29,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:29,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:29,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-24 00:30:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:29,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:29,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:29,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:29,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:29,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404207453] [2022-02-24 00:30:29,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404207453] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:29,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:29,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-24 00:30:29,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107191264] [2022-02-24 00:30:29,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:29,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-24 00:30:29,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:29,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-24 00:30:29,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-24 00:30:29,920 INFO L87 Difference]: Start difference. First operand 307 states and 415 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-24 00:30:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:30,405 INFO L93 Difference]: Finished difference Result 793 states and 1161 transitions. [2022-02-24 00:30:30,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 00:30:30,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-02-24 00:30:30,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:30,408 INFO L225 Difference]: With dead ends: 793 [2022-02-24 00:30:30,408 INFO L226 Difference]: Without dead ends: 529 [2022-02-24 00:30:30,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-02-24 00:30:30,410 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 373 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:30,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 743 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-24 00:30:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-02-24 00:30:30,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 490. [2022-02-24 00:30:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 357 states have (on average 1.2913165266106443) internal successors, (461), 366 states have internal predecessors, (461), 89 states have call successors, (89), 35 states have call predecessors, (89), 43 states have return successors, (153), 89 states have call predecessors, (153), 85 states have call successors, (153) [2022-02-24 00:30:30,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 703 transitions. [2022-02-24 00:30:30,445 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 703 transitions. Word has length 71 [2022-02-24 00:30:30,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:30,445 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 703 transitions. [2022-02-24 00:30:30,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-24 00:30:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 703 transitions. [2022-02-24 00:30:30,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-24 00:30:30,446 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:30,446 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:30,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-24 00:30:30,446 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:30,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:30,446 INFO L85 PathProgramCache]: Analyzing trace with hash -2035760571, now seen corresponding path program 1 times [2022-02-24 00:30:30,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:30,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888326173] [2022-02-24 00:30:30,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:30,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:30,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:30,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:30,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:30,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-24 00:30:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:30,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:30:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:30,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:30,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:30,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:30,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:30,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888326173] [2022-02-24 00:30:30,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888326173] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:30,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:30,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-24 00:30:30,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128690564] [2022-02-24 00:30:30,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:30,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 00:30:30,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:30,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 00:30:30,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-02-24 00:30:30,630 INFO L87 Difference]: Start difference. First operand 490 states and 703 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-24 00:30:31,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:31,215 INFO L93 Difference]: Finished difference Result 942 states and 1393 transitions. [2022-02-24 00:30:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 00:30:31,216 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2022-02-24 00:30:31,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:31,218 INFO L225 Difference]: With dead ends: 942 [2022-02-24 00:30:31,218 INFO L226 Difference]: Without dead ends: 493 [2022-02-24 00:30:31,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-02-24 00:30:31,220 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 96 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:31,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 1304 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 00:30:31,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-02-24 00:30:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 484. [2022-02-24 00:30:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 353 states have (on average 1.2832861189801699) internal successors, (453), 361 states have internal predecessors, (453), 88 states have call successors, (88), 35 states have call predecessors, (88), 42 states have return successors, (146), 88 states have call predecessors, (146), 84 states have call successors, (146) [2022-02-24 00:30:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 687 transitions. [2022-02-24 00:30:31,254 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 687 transitions. Word has length 72 [2022-02-24 00:30:31,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:31,254 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 687 transitions. [2022-02-24 00:30:31,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-24 00:30:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 687 transitions. [2022-02-24 00:30:31,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-24 00:30:31,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:31,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:31,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-24 00:30:31,255 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:31,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:31,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1777696599, now seen corresponding path program 1 times [2022-02-24 00:30:31,255 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:31,255 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719386081] [2022-02-24 00:30:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:31,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:31,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:31,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:31,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-24 00:30:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:31,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:30:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:31,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:31,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:31,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:31,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-24 00:30:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:31,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:31,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719386081] [2022-02-24 00:30:31,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719386081] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:31,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:31,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:30:31,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728945292] [2022-02-24 00:30:31,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:31,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:30:31,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:31,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:30:31,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:30:31,409 INFO L87 Difference]: Start difference. First operand 484 states and 687 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-24 00:30:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:31,997 INFO L93 Difference]: Finished difference Result 869 states and 1255 transitions. [2022-02-24 00:30:31,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:30:31,998 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2022-02-24 00:30:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:32,000 INFO L225 Difference]: With dead ends: 869 [2022-02-24 00:30:32,000 INFO L226 Difference]: Without dead ends: 450 [2022-02-24 00:30:32,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-02-24 00:30:32,002 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 232 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:32,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 999 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-24 00:30:32,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-02-24 00:30:32,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 436. [2022-02-24 00:30:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 320 states have (on average 1.296875) internal successors, (415), 329 states have internal predecessors, (415), 79 states have call successors, (79), 33 states have call predecessors, (79), 36 states have return successors, (110), 74 states have call predecessors, (110), 75 states have call successors, (110) [2022-02-24 00:30:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 604 transitions. [2022-02-24 00:30:32,032 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 604 transitions. Word has length 83 [2022-02-24 00:30:32,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:32,041 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 604 transitions. [2022-02-24 00:30:32,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-24 00:30:32,041 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 604 transitions. [2022-02-24 00:30:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-24 00:30:32,042 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:32,042 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:32,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-24 00:30:32,042 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:32,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:32,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1836701912, now seen corresponding path program 1 times [2022-02-24 00:30:32,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:32,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493418680] [2022-02-24 00:30:32,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:32,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:32,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:32,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:30:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:32,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:32,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:32,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:30:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:32,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:32,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:32,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:32,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-24 00:30:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:32,361 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:32,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493418680] [2022-02-24 00:30:32,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493418680] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:32,361 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:32,361 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-02-24 00:30:32,361 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484968182] [2022-02-24 00:30:32,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:32,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-24 00:30:32,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:32,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-24 00:30:32,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-02-24 00:30:32,362 INFO L87 Difference]: Start difference. First operand 436 states and 604 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2022-02-24 00:30:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:32,993 INFO L93 Difference]: Finished difference Result 486 states and 681 transitions. [2022-02-24 00:30:32,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-24 00:30:32,994 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2022-02-24 00:30:32,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:32,999 INFO L225 Difference]: With dead ends: 486 [2022-02-24 00:30:33,000 INFO L226 Difference]: Without dead ends: 461 [2022-02-24 00:30:33,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-02-24 00:30:33,001 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 147 mSDsluCounter, 2467 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:33,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 2705 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 00:30:33,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-02-24 00:30:33,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2022-02-24 00:30:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 329 states have (on average 1.2887537993920972) internal successors, (424), 339 states have internal predecessors, (424), 79 states have call successors, (79), 33 states have call predecessors, (79), 38 states have return successors, (116), 75 states have call predecessors, (116), 75 states have call successors, (116) [2022-02-24 00:30:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 619 transitions. [2022-02-24 00:30:33,033 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 619 transitions. Word has length 92 [2022-02-24 00:30:33,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:33,033 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 619 transitions. [2022-02-24 00:30:33,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2022-02-24 00:30:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 619 transitions. [2022-02-24 00:30:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-24 00:30:33,034 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:33,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:33,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-24 00:30:33,034 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:33,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:33,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1857542518, now seen corresponding path program 1 times [2022-02-24 00:30:33,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:33,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086185312] [2022-02-24 00:30:33,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:33,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:33,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:33,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:33,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:30:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:33,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:33,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:33,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:30:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:33,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:33,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:33,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:33,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-24 00:30:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:33,339 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:33,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086185312] [2022-02-24 00:30:33,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086185312] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:33,339 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:33,339 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-02-24 00:30:33,339 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876753741] [2022-02-24 00:30:33,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:33,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-24 00:30:33,340 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:33,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-24 00:30:33,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-02-24 00:30:33,341 INFO L87 Difference]: Start difference. First operand 447 states and 619 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2022-02-24 00:30:34,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:34,054 INFO L93 Difference]: Finished difference Result 484 states and 677 transitions. [2022-02-24 00:30:34,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-24 00:30:34,055 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2022-02-24 00:30:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:34,056 INFO L225 Difference]: With dead ends: 484 [2022-02-24 00:30:34,056 INFO L226 Difference]: Without dead ends: 459 [2022-02-24 00:30:34,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-02-24 00:30:34,057 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 153 mSDsluCounter, 2653 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 2902 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:34,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 2902 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 00:30:34,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-02-24 00:30:34,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 434. [2022-02-24 00:30:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 319 states have (on average 1.297805642633229) internal successors, (414), 328 states have internal predecessors, (414), 78 states have call successors, (78), 33 states have call predecessors, (78), 36 states have return successors, (108), 73 states have call predecessors, (108), 74 states have call successors, (108) [2022-02-24 00:30:34,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 600 transitions. [2022-02-24 00:30:34,087 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 600 transitions. Word has length 93 [2022-02-24 00:30:34,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:34,087 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 600 transitions. [2022-02-24 00:30:34,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2022-02-24 00:30:34,087 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 600 transitions. [2022-02-24 00:30:34,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-02-24 00:30:34,088 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:34,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:34,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-02-24 00:30:34,088 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:34,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:34,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1054192149, now seen corresponding path program 1 times [2022-02-24 00:30:34,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:34,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742986764] [2022-02-24 00:30:34,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:34,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:34,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:34,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:34,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:34,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:30:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:34,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:34,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:34,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:30:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:34,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:34,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:34,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:34,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-24 00:30:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:34,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-24 00:30:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:34,444 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:34,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742986764] [2022-02-24 00:30:34,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742986764] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:34,444 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:34,444 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-02-24 00:30:34,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788101073] [2022-02-24 00:30:34,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:34,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-24 00:30:34,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:34,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-24 00:30:34,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2022-02-24 00:30:34,445 INFO L87 Difference]: Start difference. First operand 434 states and 600 transitions. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-24 00:30:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:35,742 INFO L93 Difference]: Finished difference Result 470 states and 642 transitions. [2022-02-24 00:30:35,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-24 00:30:35,742 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2022-02-24 00:30:35,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:35,744 INFO L225 Difference]: With dead ends: 470 [2022-02-24 00:30:35,744 INFO L226 Difference]: Without dead ends: 434 [2022-02-24 00:30:35,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2022-02-24 00:30:35,745 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 363 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 2840 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 3049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 2840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:35,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 794 Invalid, 3049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 2840 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-24 00:30:35,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-02-24 00:30:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 424. [2022-02-24 00:30:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 313 states have (on average 1.3003194888178913) internal successors, (407), 322 states have internal predecessors, (407), 75 states have call successors, (75), 32 states have call predecessors, (75), 35 states have return successors, (105), 70 states have call predecessors, (105), 71 states have call successors, (105) [2022-02-24 00:30:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 587 transitions. [2022-02-24 00:30:35,774 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 587 transitions. Word has length 103 [2022-02-24 00:30:35,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:35,774 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 587 transitions. [2022-02-24 00:30:35,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-24 00:30:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 587 transitions. [2022-02-24 00:30:35,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-02-24 00:30:35,775 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:35,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:35,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-02-24 00:30:35,775 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:35,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:35,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1385513232, now seen corresponding path program 1 times [2022-02-24 00:30:35,775 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:35,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856567031] [2022-02-24 00:30:35,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:35,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:35,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:35,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:35,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:35,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:30:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:35,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:30:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:35,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:36,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:30:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:36,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:36,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:36,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:36,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-24 00:30:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:36,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-24 00:30:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:36,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:36,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-24 00:30:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:36,124 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:36,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856567031] [2022-02-24 00:30:36,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856567031] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:36,124 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:36,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-02-24 00:30:36,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930863914] [2022-02-24 00:30:36,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:36,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-24 00:30:36,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:36,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-24 00:30:36,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-02-24 00:30:36,127 INFO L87 Difference]: Start difference. First operand 424 states and 587 transitions. Second operand has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-24 00:30:36,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:36,879 INFO L93 Difference]: Finished difference Result 481 states and 679 transitions. [2022-02-24 00:30:36,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-24 00:30:36,880 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2022-02-24 00:30:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:36,882 INFO L225 Difference]: With dead ends: 481 [2022-02-24 00:30:36,882 INFO L226 Difference]: Without dead ends: 454 [2022-02-24 00:30:36,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2022-02-24 00:30:36,883 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 139 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:36,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 2181 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 00:30:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-02-24 00:30:36,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2022-02-24 00:30:36,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 324 states have (on average 1.2901234567901234) internal successors, (418), 334 states have internal predecessors, (418), 78 states have call successors, (78), 32 states have call predecessors, (78), 37 states have return successors, (114), 74 states have call predecessors, (114), 73 states have call successors, (114) [2022-02-24 00:30:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 610 transitions. [2022-02-24 00:30:36,914 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 610 transitions. Word has length 108 [2022-02-24 00:30:36,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:36,914 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 610 transitions. [2022-02-24 00:30:36,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-24 00:30:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 610 transitions. [2022-02-24 00:30:36,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-02-24 00:30:36,915 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:36,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:36,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-02-24 00:30:36,915 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:36,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:36,915 INFO L85 PathProgramCache]: Analyzing trace with hash -205451642, now seen corresponding path program 1 times [2022-02-24 00:30:36,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:36,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588267600] [2022-02-24 00:30:36,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:36,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:36,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:37,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:37,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:37,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:30:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:37,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:30:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:37,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:37,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:30:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:37,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:37,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:37,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:37,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-24 00:30:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:37,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-24 00:30:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:37,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:37,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-02-24 00:30:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:37,278 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:37,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588267600] [2022-02-24 00:30:37,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588267600] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:37,279 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:37,279 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-02-24 00:30:37,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450728303] [2022-02-24 00:30:37,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:37,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-24 00:30:37,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:37,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-24 00:30:37,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-02-24 00:30:37,280 INFO L87 Difference]: Start difference. First operand 440 states and 610 transitions. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-24 00:30:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:38,435 INFO L93 Difference]: Finished difference Result 483 states and 677 transitions. [2022-02-24 00:30:38,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-24 00:30:38,436 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2022-02-24 00:30:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:38,438 INFO L225 Difference]: With dead ends: 483 [2022-02-24 00:30:38,438 INFO L226 Difference]: Without dead ends: 443 [2022-02-24 00:30:38,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2022-02-24 00:30:38,439 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 139 mSDsluCounter, 2465 mSDsCounter, 0 mSdLazyCounter, 2483 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 2563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:38,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 2703 Invalid, 2563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2483 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-24 00:30:38,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-02-24 00:30:38,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 413. [2022-02-24 00:30:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 304 states have (on average 1.2664473684210527) internal successors, (385), 312 states have internal predecessors, (385), 75 states have call successors, (75), 32 states have call predecessors, (75), 33 states have return successors, (97), 69 states have call predecessors, (97), 70 states have call successors, (97) [2022-02-24 00:30:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 557 transitions. [2022-02-24 00:30:38,469 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 557 transitions. Word has length 109 [2022-02-24 00:30:38,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:38,469 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 557 transitions. [2022-02-24 00:30:38,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-24 00:30:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 557 transitions. [2022-02-24 00:30:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-24 00:30:38,470 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:38,470 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:38,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-02-24 00:30:38,470 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:38,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:38,471 INFO L85 PathProgramCache]: Analyzing trace with hash -790809002, now seen corresponding path program 1 times [2022-02-24 00:30:38,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:38,471 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756446471] [2022-02-24 00:30:38,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:38,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:38,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:38,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:38,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-24 00:30:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:38,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:30:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:38,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:38,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:38,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:38,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-24 00:30:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:38,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-24 00:30:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:38,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:38,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:30:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:38,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:38,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:38,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:38,644 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-24 00:30:38,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:38,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756446471] [2022-02-24 00:30:38,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756446471] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:38,644 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:38,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-24 00:30:38,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998934393] [2022-02-24 00:30:38,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:38,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-24 00:30:38,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:38,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-24 00:30:38,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-02-24 00:30:38,645 INFO L87 Difference]: Start difference. First operand 413 states and 557 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-02-24 00:30:39,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:39,023 INFO L93 Difference]: Finished difference Result 734 states and 984 transitions. [2022-02-24 00:30:39,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:30:39,023 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2022-02-24 00:30:39,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:39,025 INFO L225 Difference]: With dead ends: 734 [2022-02-24 00:30:39,025 INFO L226 Difference]: Without dead ends: 420 [2022-02-24 00:30:39,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-02-24 00:30:39,027 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 172 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:39,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 1046 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-24 00:30:39,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-02-24 00:30:39,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 408. [2022-02-24 00:30:39,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 302 states have (on average 1.2483443708609272) internal successors, (377), 309 states have internal predecessors, (377), 71 states have call successors, (71), 32 states have call predecessors, (71), 34 states have return successors, (92), 67 states have call predecessors, (92), 66 states have call successors, (92) [2022-02-24 00:30:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 540 transitions. [2022-02-24 00:30:39,055 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 540 transitions. Word has length 121 [2022-02-24 00:30:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:39,055 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 540 transitions. [2022-02-24 00:30:39,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-02-24 00:30:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 540 transitions. [2022-02-24 00:30:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-02-24 00:30:39,056 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:39,056 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:39,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-02-24 00:30:39,056 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:39,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash -474317813, now seen corresponding path program 1 times [2022-02-24 00:30:39,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:39,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156505136] [2022-02-24 00:30:39,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:39,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-24 00:30:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:30:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-24 00:30:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-24 00:30:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:30:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-24 00:30:39,248 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:39,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156505136] [2022-02-24 00:30:39,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156505136] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:39,248 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:39,248 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-24 00:30:39,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071434961] [2022-02-24 00:30:39,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:39,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-24 00:30:39,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:39,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-24 00:30:39,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-02-24 00:30:39,250 INFO L87 Difference]: Start difference. First operand 408 states and 540 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-02-24 00:30:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:39,782 INFO L93 Difference]: Finished difference Result 592 states and 836 transitions. [2022-02-24 00:30:39,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:30:39,782 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2022-02-24 00:30:39,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:39,785 INFO L225 Difference]: With dead ends: 592 [2022-02-24 00:30:39,785 INFO L226 Difference]: Without dead ends: 547 [2022-02-24 00:30:39,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-02-24 00:30:39,785 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 167 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:39,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 1515 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-24 00:30:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-02-24 00:30:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 399. [2022-02-24 00:30:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 294 states have (on average 1.248299319727891) internal successors, (367), 301 states have internal predecessors, (367), 71 states have call successors, (71), 32 states have call predecessors, (71), 33 states have return successors, (91), 66 states have call predecessors, (91), 66 states have call successors, (91) [2022-02-24 00:30:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 529 transitions. [2022-02-24 00:30:39,816 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 529 transitions. Word has length 122 [2022-02-24 00:30:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:39,816 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 529 transitions. [2022-02-24 00:30:39,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-02-24 00:30:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 529 transitions. [2022-02-24 00:30:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-02-24 00:30:39,817 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:39,817 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:39,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-02-24 00:30:39,818 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:39,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash -286096315, now seen corresponding path program 1 times [2022-02-24 00:30:39,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:39,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947823708] [2022-02-24 00:30:39,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:39,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:30:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:39,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:30:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:40,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:40,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:30:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:40,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:40,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:40,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:40,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-24 00:30:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:40,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-24 00:30:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:40,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-24 00:30:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:40,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:40,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-24 00:30:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:40,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:40,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947823708] [2022-02-24 00:30:40,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947823708] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:40,212 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:40,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-02-24 00:30:40,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740789752] [2022-02-24 00:30:40,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:40,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-24 00:30:40,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:40,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-24 00:30:40,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2022-02-24 00:30:40,214 INFO L87 Difference]: Start difference. First operand 399 states and 529 transitions. Second operand has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-02-24 00:30:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:41,580 INFO L93 Difference]: Finished difference Result 416 states and 551 transitions. [2022-02-24 00:30:41,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-24 00:30:41,580 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 119 [2022-02-24 00:30:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:41,582 INFO L225 Difference]: With dead ends: 416 [2022-02-24 00:30:41,582 INFO L226 Difference]: Without dead ends: 354 [2022-02-24 00:30:41,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=1718, Unknown=0, NotChecked=0, Total=1980 [2022-02-24 00:30:41,583 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 401 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 3007 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 3228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 3007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:41,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 496 Invalid, 3228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 3007 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-24 00:30:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-02-24 00:30:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 341. [2022-02-24 00:30:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 250 states have (on average 1.18) internal successors, (295), 255 states have internal predecessors, (295), 64 states have call successors, (64), 29 states have call predecessors, (64), 26 states have return successors, (77), 56 states have call predecessors, (77), 58 states have call successors, (77) [2022-02-24 00:30:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 436 transitions. [2022-02-24 00:30:41,610 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 436 transitions. Word has length 119 [2022-02-24 00:30:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:41,610 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 436 transitions. [2022-02-24 00:30:41,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-02-24 00:30:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 436 transitions. [2022-02-24 00:30:41,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-02-24 00:30:41,611 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:41,612 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:41,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-02-24 00:30:41,612 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:41,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash 762913287, now seen corresponding path program 1 times [2022-02-24 00:30:41,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:41,612 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743414262] [2022-02-24 00:30:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:41,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-24 00:30:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:30:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-24 00:30:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-24 00:30:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:30:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-24 00:30:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-24 00:30:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-02-24 00:30:41,855 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:41,856 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743414262] [2022-02-24 00:30:41,856 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743414262] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-24 00:30:41,856 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286317896] [2022-02-24 00:30:41,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:41,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-24 00:30:41,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-24 00:30:41,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-24 00:30:41,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-24 00:30:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-24 00:30:42,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-24 00:30:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-02-24 00:30:42,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-24 00:30:42,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286317896] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:42,278 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-24 00:30:42,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2022-02-24 00:30:42,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974781036] [2022-02-24 00:30:42,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:42,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-24 00:30:42,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:42,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-24 00:30:42,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-02-24 00:30:42,279 INFO L87 Difference]: Start difference. First operand 341 states and 436 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-24 00:30:42,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:42,310 INFO L93 Difference]: Finished difference Result 352 states and 447 transitions. [2022-02-24 00:30:42,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-24 00:30:42,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 163 [2022-02-24 00:30:42,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:42,311 INFO L225 Difference]: With dead ends: 352 [2022-02-24 00:30:42,311 INFO L226 Difference]: Without dead ends: 341 [2022-02-24 00:30:42,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-02-24 00:30:42,312 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 28 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:42,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 303 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 00:30:42,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-02-24 00:30:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-02-24 00:30:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 250 states have (on average 1.172) internal successors, (293), 255 states have internal predecessors, (293), 64 states have call successors, (64), 29 states have call predecessors, (64), 26 states have return successors, (77), 56 states have call predecessors, (77), 58 states have call successors, (77) [2022-02-24 00:30:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 434 transitions. [2022-02-24 00:30:42,342 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 434 transitions. Word has length 163 [2022-02-24 00:30:42,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:42,343 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 434 transitions. [2022-02-24 00:30:42,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-24 00:30:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 434 transitions. [2022-02-24 00:30:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-02-24 00:30:42,344 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:42,344 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:42,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-24 00:30:42,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-02-24 00:30:42,563 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:42,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:42,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1424868086, now seen corresponding path program 1 times [2022-02-24 00:30:42,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:42,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690737477] [2022-02-24 00:30:42,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:42,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-24 00:30:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:30:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-24 00:30:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-24 00:30:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:30:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-24 00:30:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-24 00:30:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-02-24 00:30:42,777 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:42,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690737477] [2022-02-24 00:30:42,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690737477] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-24 00:30:42,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501029133] [2022-02-24 00:30:42,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:42,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-24 00:30:42,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-24 00:30:42,779 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-24 00:30:42,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-24 00:30:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-24 00:30:42,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-24 00:30:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-24 00:30:43,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-24 00:30:43,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501029133] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:43,267 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-24 00:30:43,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 15 [2022-02-24 00:30:43,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749107417] [2022-02-24 00:30:43,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:43,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 00:30:43,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:43,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 00:30:43,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-02-24 00:30:43,268 INFO L87 Difference]: Start difference. First operand 341 states and 434 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-02-24 00:30:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:43,329 INFO L93 Difference]: Finished difference Result 630 states and 816 transitions. [2022-02-24 00:30:43,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 00:30:43,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 163 [2022-02-24 00:30:43,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:43,331 INFO L225 Difference]: With dead ends: 630 [2022-02-24 00:30:43,331 INFO L226 Difference]: Without dead ends: 372 [2022-02-24 00:30:43,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-02-24 00:30:43,332 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 12 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:43,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 826 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 00:30:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-02-24 00:30:43,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 361. [2022-02-24 00:30:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 268 states have (on average 1.1604477611940298) internal successors, (311), 273 states have internal predecessors, (311), 64 states have call successors, (64), 29 states have call predecessors, (64), 28 states have return successors, (88), 58 states have call predecessors, (88), 58 states have call successors, (88) [2022-02-24 00:30:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 463 transitions. [2022-02-24 00:30:43,383 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 463 transitions. Word has length 163 [2022-02-24 00:30:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:43,384 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 463 transitions. [2022-02-24 00:30:43,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-02-24 00:30:43,384 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 463 transitions. [2022-02-24 00:30:43,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-02-24 00:30:43,385 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:43,385 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:43,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-24 00:30:43,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-02-24 00:30:43,599 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:43,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:43,600 INFO L85 PathProgramCache]: Analyzing trace with hash -589316084, now seen corresponding path program 1 times [2022-02-24 00:30:43,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:43,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081831153] [2022-02-24 00:30:43,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:43,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-24 00:30:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:30:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-24 00:30:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-24 00:30:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:30:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-24 00:30:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-24 00:30:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-02-24 00:30:43,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:43,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081831153] [2022-02-24 00:30:43,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081831153] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:43,840 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:43,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-24 00:30:43,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971233618] [2022-02-24 00:30:43,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:43,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-24 00:30:43,841 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:43,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-24 00:30:43,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-02-24 00:30:43,841 INFO L87 Difference]: Start difference. First operand 361 states and 463 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2022-02-24 00:30:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:44,595 INFO L93 Difference]: Finished difference Result 655 states and 841 transitions. [2022-02-24 00:30:44,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:30:44,596 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) Word has length 164 [2022-02-24 00:30:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:44,598 INFO L225 Difference]: With dead ends: 655 [2022-02-24 00:30:44,598 INFO L226 Difference]: Without dead ends: 428 [2022-02-24 00:30:44,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-02-24 00:30:44,602 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 115 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:44,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 1240 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-24 00:30:44,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-02-24 00:30:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 345. [2022-02-24 00:30:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 256 states have (on average 1.14453125) internal successors, (293), 260 states have internal predecessors, (293), 60 states have call successors, (60), 29 states have call predecessors, (60), 28 states have return successors, (80), 55 states have call predecessors, (80), 54 states have call successors, (80) [2022-02-24 00:30:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 433 transitions. [2022-02-24 00:30:44,632 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 433 transitions. Word has length 164 [2022-02-24 00:30:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:44,633 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 433 transitions. [2022-02-24 00:30:44,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2022-02-24 00:30:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 433 transitions. [2022-02-24 00:30:44,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-02-24 00:30:44,634 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:44,634 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:44,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-02-24 00:30:44,635 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:44,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash -158276280, now seen corresponding path program 1 times [2022-02-24 00:30:44,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:44,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109922743] [2022-02-24 00:30:44,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:44,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-24 00:30:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:30:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-24 00:30:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-24 00:30:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:30:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-24 00:30:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-24 00:30:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-02-24 00:30:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-02-24 00:30:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-02-24 00:30:44,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:44,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109922743] [2022-02-24 00:30:44,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109922743] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:44,880 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:44,880 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-24 00:30:44,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131073418] [2022-02-24 00:30:44,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:44,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-24 00:30:44,881 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:44,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-24 00:30:44,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-02-24 00:30:44,881 INFO L87 Difference]: Start difference. First operand 345 states and 433 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2022-02-24 00:30:45,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:45,254 INFO L93 Difference]: Finished difference Result 443 states and 558 transitions. [2022-02-24 00:30:45,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:30:45,254 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) Word has length 204 [2022-02-24 00:30:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:45,256 INFO L225 Difference]: With dead ends: 443 [2022-02-24 00:30:45,256 INFO L226 Difference]: Without dead ends: 354 [2022-02-24 00:30:45,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-02-24 00:30:45,257 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 237 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:45,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 897 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-24 00:30:45,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-02-24 00:30:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 309. [2022-02-24 00:30:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 231 states have (on average 1.1255411255411256) internal successors, (260), 234 states have internal predecessors, (260), 52 states have call successors, (52), 24 states have call predecessors, (52), 25 states have return successors, (73), 50 states have call predecessors, (73), 47 states have call successors, (73) [2022-02-24 00:30:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 385 transitions. [2022-02-24 00:30:45,281 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 385 transitions. Word has length 204 [2022-02-24 00:30:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:45,282 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 385 transitions. [2022-02-24 00:30:45,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2022-02-24 00:30:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 385 transitions. [2022-02-24 00:30:45,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-02-24 00:30:45,283 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:45,283 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:45,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-02-24 00:30:45,284 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:45,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1341132510, now seen corresponding path program 1 times [2022-02-24 00:30:45,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:45,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644511989] [2022-02-24 00:30:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:45,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-24 00:30:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:30:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-24 00:30:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-24 00:30:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:30:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-24 00:30:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-24 00:30:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-02-24 00:30:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-02-24 00:30:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:30:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-02-24 00:30:45,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:45,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644511989] [2022-02-24 00:30:45,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644511989] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:45,502 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:45,502 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-24 00:30:45,502 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015146608] [2022-02-24 00:30:45,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:45,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-24 00:30:45,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:45,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-24 00:30:45,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-02-24 00:30:45,503 INFO L87 Difference]: Start difference. First operand 309 states and 385 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2022-02-24 00:30:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:45,867 INFO L93 Difference]: Finished difference Result 315 states and 397 transitions. [2022-02-24 00:30:45,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:30:45,868 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) Word has length 207 [2022-02-24 00:30:45,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:45,868 INFO L225 Difference]: With dead ends: 315 [2022-02-24 00:30:45,868 INFO L226 Difference]: Without dead ends: 0 [2022-02-24 00:30:45,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-02-24 00:30:45,870 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 117 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:45,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 673 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-24 00:30:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-24 00:30:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-24 00:30:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-24 00:30:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-24 00:30:45,871 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2022-02-24 00:30:45,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:45,871 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-24 00:30:45,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2022-02-24 00:30:45,871 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-24 00:30:45,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-24 00:30:45,873 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-24 00:30:45,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-02-24 00:30:45,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.