./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product29.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product29.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d12edbd4df2f08d75221f3c96b68e50e6394815b34a699d313e71ea24bf9c38 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:38:26,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:38:26,632 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:38:26,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:38:26,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:38:26,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:38:26,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:38:26,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:38:26,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:38:26,677 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:38:26,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:38:26,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:38:26,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:38:26,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:38:26,681 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:38:26,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:38:26,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:38:26,682 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:38:26,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:38:26,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:38:26,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:38:26,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:38:26,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:38:26,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:38:26,684 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:38:26,684 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:38:26,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:38:26,685 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:38:26,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:38:26,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:38:26,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:38:26,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:38:26,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:38:26,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:38:26,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:38:26,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:38:26,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:38:26,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:38:26,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:38:26,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:38:26,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:38:26,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:38:26,694 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-clean/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d12edbd4df2f08d75221f3c96b68e50e6394815b34a699d313e71ea24bf9c38 [2024-10-11 02:38:26,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:38:26,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:38:26,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:38:26,986 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:38:26,986 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:38:26,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product29.cil.c [2024-10-11 02:38:28,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:38:28,780 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:38:28,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product29.cil.c [2024-10-11 02:38:28,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eccd863e9/e6736821115a4116ae2268790f81e82b/FLAGda08ad0d6 [2024-10-11 02:38:28,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eccd863e9/e6736821115a4116ae2268790f81e82b [2024-10-11 02:38:28,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:38:28,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:38:28,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:38:28,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:38:28,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:38:28,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:38:28" (1/1) ... [2024-10-11 02:38:28,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad5a867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:28, skipping insertion in model container [2024-10-11 02:38:28,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:38:28" (1/1) ... [2024-10-11 02:38:28,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:38:29,337 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product29.cil.c[40506,40519] [2024-10-11 02:38:29,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:38:29,474 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:38:29,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2024-10-11 02:38:29,485 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [716] [2024-10-11 02:38:29,486 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [754] [2024-10-11 02:38:29,486 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1120] [2024-10-11 02:38:29,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1220] [2024-10-11 02:38:29,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1340] [2024-10-11 02:38:29,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [1358] [2024-10-11 02:38:29,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1548] [2024-10-11 02:38:29,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1897] [2024-10-11 02:38:29,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1906] [2024-10-11 02:38:29,562 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product29.cil.c[40506,40519] [2024-10-11 02:38:29,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:38:29,724 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:38:29,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29 WrapperNode [2024-10-11 02:38:29,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:38:29,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:38:29,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:38:29,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:38:29,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,845 INFO L138 Inliner]: procedures = 91, calls = 347, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 927 [2024-10-11 02:38:29,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:38:29,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:38:29,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:38:29,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:38:29,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,926 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-11 02:38:29,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:30,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:30,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:38:30,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:38:30,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:38:30,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:38:30,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:30,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:38:30,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:38:30,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:38:30,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:38:30,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:38:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-10-11 02:38:30,110 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-10-11 02:38:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:38:30,110 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:38:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:38:30,110 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:38:30,111 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:38:30,111 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:38:30,111 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-11 02:38:30,112 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-11 02:38:30,112 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:38:30,112 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:38:30,112 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-10-11 02:38:30,112 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-10-11 02:38:30,112 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:38:30,113 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:38:30,113 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:38:30,113 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:38:30,113 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:38:30,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:38:30,113 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:38:30,113 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:38:30,113 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:38:30,114 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:38:30,114 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:38:30,114 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:38:30,114 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-11 02:38:30,114 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-11 02:38:30,114 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-10-11 02:38:30,114 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-10-11 02:38:30,115 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:38:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:38:30,115 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:38:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:38:30,115 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-10-11 02:38:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-10-11 02:38:30,115 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:38:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:38:30,115 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:38:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:38:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:38:30,116 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:38:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:38:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:38:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:38:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:38:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:38:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:38:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:38:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:38:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:38:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:38:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:38:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:38:30,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:38:30,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:38:30,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:38:30,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:38:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:38:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:38:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:38:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:38:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-11 02:38:30,122 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-11 02:38:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:38:30,122 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:38:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:38:30,123 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:38:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:38:30,123 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:38:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:38:30,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:38:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:38:30,124 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:38:30,321 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:38:30,325 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:38:31,591 INFO L? ?]: Removed 470 outVars from TransFormulas that were not future-live. [2024-10-11 02:38:31,591 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:38:31,702 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:38:31,703 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:38:31,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:38:31 BoogieIcfgContainer [2024-10-11 02:38:31,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:38:31,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:38:31,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:38:31,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:38:31,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:38:28" (1/3) ... [2024-10-11 02:38:31,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ff9e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:38:31, skipping insertion in model container [2024-10-11 02:38:31,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (2/3) ... [2024-10-11 02:38:31,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ff9e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:38:31, skipping insertion in model container [2024-10-11 02:38:31,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:38:31" (3/3) ... [2024-10-11 02:38:31,717 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product29.cil.c [2024-10-11 02:38:31,736 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:38:31,737 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:38:31,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:38:31,834 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@cfebc8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:38:31,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:38:31,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 576 states, 442 states have (on average 1.7104072398190044) internal successors, (756), 460 states have internal predecessors, (756), 106 states have call successors, (106), 26 states have call predecessors, (106), 26 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) [2024-10-11 02:38:31,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 02:38:31,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:31,870 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:38:31,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:31,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:31,876 INFO L85 PathProgramCache]: Analyzing trace with hash 489959255, now seen corresponding path program 1 times [2024-10-11 02:38:31,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:31,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032298458] [2024-10-11 02:38:31,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:31,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:32,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:33,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:33,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:33,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:33,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:33,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:38:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:33,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:38:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:33,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:38:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:33,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:38:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:33,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:38:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:33,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:38:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:33,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:38:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:33,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:33,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032298458] [2024-10-11 02:38:33,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032298458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:33,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:33,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:33,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150733107] [2024-10-11 02:38:33,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:33,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:33,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:33,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:33,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:33,374 INFO L87 Difference]: Start difference. First operand has 576 states, 442 states have (on average 1.7104072398190044) internal successors, (756), 460 states have internal predecessors, (756), 106 states have call successors, (106), 26 states have call predecessors, (106), 26 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:38:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:41,757 INFO L93 Difference]: Finished difference Result 1499 states and 2627 transitions. [2024-10-11 02:38:41,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:38:41,761 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 89 [2024-10-11 02:38:41,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:41,792 INFO L225 Difference]: With dead ends: 1499 [2024-10-11 02:38:41,793 INFO L226 Difference]: Without dead ends: 920 [2024-10-11 02:38:41,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:38:41,811 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 2288 mSDsluCounter, 2549 mSDsCounter, 0 mSdLazyCounter, 5675 mSolverCounterSat, 695 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2399 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 6370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 695 IncrementalHoareTripleChecker+Valid, 5675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:41,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 3028 Invalid, 6370 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [695 Valid, 5675 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-11 02:38:41,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-11 02:38:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 582. [2024-10-11 02:38:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 448 states have (on average 1.6964285714285714) internal successors, (760), 466 states have internal predecessors, (760), 107 states have call successors, (107), 26 states have call predecessors, (107), 26 states have return successors, (106), 102 states have call predecessors, (106), 104 states have call successors, (106) [2024-10-11 02:38:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 973 transitions. [2024-10-11 02:38:42,083 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 973 transitions. Word has length 89 [2024-10-11 02:38:42,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:42,084 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 973 transitions. [2024-10-11 02:38:42,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:38:42,084 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 973 transitions. [2024-10-11 02:38:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 02:38:42,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:42,090 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:38:42,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:38:42,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:42,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:42,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2022771519, now seen corresponding path program 1 times [2024-10-11 02:38:42,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:42,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909829743] [2024-10-11 02:38:42,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:42,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:42,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:42,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:42,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:42,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:42,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:42,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:38:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:42,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:38:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:42,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:38:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:42,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:38:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:42,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:38:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:42,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:38:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:42,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:38:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:42,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:42,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909829743] [2024-10-11 02:38:42,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909829743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:42,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:42,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:42,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318740564] [2024-10-11 02:38:42,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:42,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:42,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:42,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:42,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:42,957 INFO L87 Difference]: Start difference. First operand 582 states and 973 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:38:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:49,712 INFO L93 Difference]: Finished difference Result 1492 states and 2576 transitions. [2024-10-11 02:38:49,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:49,712 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 90 [2024-10-11 02:38:49,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:49,722 INFO L225 Difference]: With dead ends: 1492 [2024-10-11 02:38:49,722 INFO L226 Difference]: Without dead ends: 920 [2024-10-11 02:38:49,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:38:49,728 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 2263 mSDsluCounter, 2285 mSDsCounter, 0 mSdLazyCounter, 5570 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 6273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 5570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:49,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2374 Valid, 2716 Invalid, 6273 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [703 Valid, 5570 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-11 02:38:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-11 02:38:49,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 582. [2024-10-11 02:38:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 448 states have (on average 1.6941964285714286) internal successors, (759), 466 states have internal predecessors, (759), 107 states have call successors, (107), 26 states have call predecessors, (107), 26 states have return successors, (106), 102 states have call predecessors, (106), 104 states have call successors, (106) [2024-10-11 02:38:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 972 transitions. [2024-10-11 02:38:49,861 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 972 transitions. Word has length 90 [2024-10-11 02:38:49,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:49,862 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 972 transitions. [2024-10-11 02:38:49,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:38:49,862 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 972 transitions. [2024-10-11 02:38:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 02:38:49,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:49,865 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:38:49,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:38:49,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:49,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:49,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1321647835, now seen corresponding path program 1 times [2024-10-11 02:38:49,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:49,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218215463] [2024-10-11 02:38:49,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:49,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:38:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:38:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:38:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:38:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:38:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:38:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:38:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:38:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:50,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:50,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218215463] [2024-10-11 02:38:50,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218215463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:50,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:50,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:38:50,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889752906] [2024-10-11 02:38:50,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:50,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:38:50,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:50,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:38:50,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:38:50,412 INFO L87 Difference]: Start difference. First operand 582 states and 972 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:38:55,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:55,543 INFO L93 Difference]: Finished difference Result 1486 states and 2559 transitions. [2024-10-11 02:38:55,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:38:55,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 90 [2024-10-11 02:38:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:55,550 INFO L225 Difference]: With dead ends: 1486 [2024-10-11 02:38:55,550 INFO L226 Difference]: Without dead ends: 885 [2024-10-11 02:38:55,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:38:55,555 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 1657 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 3027 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1768 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 3517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 3027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:55,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1768 Valid, 1499 Invalid, 3517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 3027 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 02:38:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-11 02:38:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 559. [2024-10-11 02:38:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 428 states have (on average 1.6845794392523366) internal successors, (721), 444 states have internal predecessors, (721), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:38:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 930 transitions. [2024-10-11 02:38:55,694 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 930 transitions. Word has length 90 [2024-10-11 02:38:55,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:55,696 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 930 transitions. [2024-10-11 02:38:55,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:38:55,697 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 930 transitions. [2024-10-11 02:38:55,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 02:38:55,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:55,699 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:38:55,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:38:55,700 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:55,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:55,700 INFO L85 PathProgramCache]: Analyzing trace with hash 411443171, now seen corresponding path program 1 times [2024-10-11 02:38:55,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:55,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480140384] [2024-10-11 02:38:55,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:55,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:38:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:38:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:38:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:38:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:38:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:38:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:38:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:56,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:56,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480140384] [2024-10-11 02:38:56,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480140384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:56,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:56,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:56,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588001161] [2024-10-11 02:38:56,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:56,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:56,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:56,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:56,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:56,363 INFO L87 Difference]: Start difference. First operand 559 states and 930 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:39:02,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:02,844 INFO L93 Difference]: Finished difference Result 1450 states and 2491 transitions. [2024-10-11 02:39:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:39:02,845 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 91 [2024-10-11 02:39:02,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:02,851 INFO L225 Difference]: With dead ends: 1450 [2024-10-11 02:39:02,851 INFO L226 Difference]: Without dead ends: 879 [2024-10-11 02:39:02,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:39:02,856 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 1128 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 5664 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 2861 SdHoareTripleChecker+Invalid, 5938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 5664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:02,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 2861 Invalid, 5938 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [274 Valid, 5664 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-11 02:39:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-10-11 02:39:03,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 553. [2024-10-11 02:39:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 422 states have (on average 1.6777251184834123) internal successors, (708), 438 states have internal predecessors, (708), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:39:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 917 transitions. [2024-10-11 02:39:03,014 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 917 transitions. Word has length 91 [2024-10-11 02:39:03,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:03,014 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 917 transitions. [2024-10-11 02:39:03,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:39:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 917 transitions. [2024-10-11 02:39:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 02:39:03,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:03,018 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:39:03,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:39:03,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:03,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:03,019 INFO L85 PathProgramCache]: Analyzing trace with hash -558708439, now seen corresponding path program 1 times [2024-10-11 02:39:03,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:03,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490374672] [2024-10-11 02:39:03,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:03,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:39:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:39:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:39:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:39:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:39:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:39:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:39:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:39:03,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:03,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490374672] [2024-10-11 02:39:03,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490374672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:03,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:03,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:39:03,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469932207] [2024-10-11 02:39:03,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:03,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:39:03,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:03,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:39:03,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:39:03,685 INFO L87 Difference]: Start difference. First operand 553 states and 917 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:39:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:09,642 INFO L93 Difference]: Finished difference Result 1422 states and 2442 transitions. [2024-10-11 02:39:09,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:39:09,643 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 92 [2024-10-11 02:39:09,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:09,649 INFO L225 Difference]: With dead ends: 1422 [2024-10-11 02:39:09,649 INFO L226 Difference]: Without dead ends: 879 [2024-10-11 02:39:09,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:39:09,653 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 2129 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 5290 mSolverCounterSat, 692 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2240 SdHoareTripleChecker+Valid, 2821 SdHoareTripleChecker+Invalid, 5982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 692 IncrementalHoareTripleChecker+Valid, 5290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:09,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2240 Valid, 2821 Invalid, 5982 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [692 Valid, 5290 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 02:39:09,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-10-11 02:39:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 553. [2024-10-11 02:39:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 422 states have (on average 1.6753554502369667) internal successors, (707), 438 states have internal predecessors, (707), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:39:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 916 transitions. [2024-10-11 02:39:09,781 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 916 transitions. Word has length 92 [2024-10-11 02:39:09,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:09,781 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 916 transitions. [2024-10-11 02:39:09,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:39:09,781 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 916 transitions. [2024-10-11 02:39:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 02:39:09,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:09,783 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-10-11 02:39:09,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:39:09,784 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:09,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:09,784 INFO L85 PathProgramCache]: Analyzing trace with hash -192658624, now seen corresponding path program 1 times [2024-10-11 02:39:09,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:09,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396795556] [2024-10-11 02:39:09,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:09,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:39:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:39:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:39:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:39:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:39:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:39:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:39:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:39:10,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:10,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396795556] [2024-10-11 02:39:10,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396795556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:10,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:10,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:39:10,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679346417] [2024-10-11 02:39:10,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:10,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:39:10,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:10,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:39:10,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:39:10,463 INFO L87 Difference]: Start difference. First operand 553 states and 916 transitions. Second operand has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:39:16,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:16,859 INFO L93 Difference]: Finished difference Result 1438 states and 2460 transitions. [2024-10-11 02:39:16,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:39:16,859 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 93 [2024-10-11 02:39:16,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:16,865 INFO L225 Difference]: With dead ends: 1438 [2024-10-11 02:39:16,865 INFO L226 Difference]: Without dead ends: 873 [2024-10-11 02:39:16,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:39:16,868 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 1096 mSDsluCounter, 2434 mSDsCounter, 0 mSdLazyCounter, 5631 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 5900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 5631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:16,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 2879 Invalid, 5900 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [269 Valid, 5631 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-11 02:39:16,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-10-11 02:39:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 547. [2024-10-11 02:39:16,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 416 states have (on average 1.6682692307692308) internal successors, (694), 432 states have internal predecessors, (694), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:39:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 903 transitions. [2024-10-11 02:39:16,988 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 903 transitions. Word has length 93 [2024-10-11 02:39:16,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:16,988 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 903 transitions. [2024-10-11 02:39:16,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:39:16,988 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 903 transitions. [2024-10-11 02:39:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 02:39:16,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:16,990 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1] [2024-10-11 02:39:16,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:39:16,990 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:16,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:16,991 INFO L85 PathProgramCache]: Analyzing trace with hash -732895190, now seen corresponding path program 1 times [2024-10-11 02:39:16,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:16,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048969951] [2024-10-11 02:39:16,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:16,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:17,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:17,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:17,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:17,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:17,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:17,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:39:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:17,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 02:39:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:17,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:39:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:17,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:39:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:17,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:39:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:17,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:39:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:17,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:39:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:39:17,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:17,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048969951] [2024-10-11 02:39:17,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048969951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:17,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:17,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:39:17,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336876421] [2024-10-11 02:39:17,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:17,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:39:17,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:17,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:39:17,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:39:17,585 INFO L87 Difference]: Start difference. First operand 547 states and 903 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:39:22,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:22,433 INFO L93 Difference]: Finished difference Result 1410 states and 2413 transitions. [2024-10-11 02:39:22,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:39:22,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 94 [2024-10-11 02:39:22,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:22,440 INFO L225 Difference]: With dead ends: 1410 [2024-10-11 02:39:22,440 INFO L226 Difference]: Without dead ends: 873 [2024-10-11 02:39:22,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:39:22,444 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 1037 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 2980 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 3251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:22,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 1580 Invalid, 3251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2980 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 02:39:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-10-11 02:39:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 547. [2024-10-11 02:39:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 416 states have (on average 1.6658653846153846) internal successors, (693), 432 states have internal predecessors, (693), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:39:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 902 transitions. [2024-10-11 02:39:22,583 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 902 transitions. Word has length 94 [2024-10-11 02:39:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:22,583 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 902 transitions. [2024-10-11 02:39:22,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:39:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 902 transitions. [2024-10-11 02:39:22,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 02:39:22,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:22,587 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-10-11 02:39:22,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:39:22,587 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:22,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:22,588 INFO L85 PathProgramCache]: Analyzing trace with hash -42897628, now seen corresponding path program 1 times [2024-10-11 02:39:22,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:22,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558261044] [2024-10-11 02:39:22,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:22,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:22,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:23,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:23,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:23,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:23,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:23,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:39:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:23,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:39:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:23,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:39:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:23,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:39:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:23,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:39:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:23,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:39:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:23,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:39:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:39:23,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:23,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558261044] [2024-10-11 02:39:23,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558261044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:23,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:23,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:39:23,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271795529] [2024-10-11 02:39:23,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:23,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:39:23,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:23,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:39:23,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:39:23,210 INFO L87 Difference]: Start difference. First operand 547 states and 902 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:39:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:29,979 INFO L93 Difference]: Finished difference Result 1426 states and 2429 transitions. [2024-10-11 02:39:29,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:39:29,980 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 95 [2024-10-11 02:39:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:29,986 INFO L225 Difference]: With dead ends: 1426 [2024-10-11 02:39:29,986 INFO L226 Difference]: Without dead ends: 867 [2024-10-11 02:39:29,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:39:29,989 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 1069 mSDsluCounter, 2382 mSDsCounter, 0 mSdLazyCounter, 5445 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 5719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 5445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:29,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 2818 Invalid, 5719 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [274 Valid, 5445 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-11 02:39:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-10-11 02:39:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 541. [2024-10-11 02:39:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 410 states have (on average 1.6585365853658536) internal successors, (680), 426 states have internal predecessors, (680), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:39:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 889 transitions. [2024-10-11 02:39:30,114 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 889 transitions. Word has length 95 [2024-10-11 02:39:30,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:30,115 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 889 transitions. [2024-10-11 02:39:30,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:39:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 889 transitions. [2024-10-11 02:39:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 02:39:30,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:30,118 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-10-11 02:39:30,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:39:30,118 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:30,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1027397571, now seen corresponding path program 1 times [2024-10-11 02:39:30,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:30,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901069511] [2024-10-11 02:39:30,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:30,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:39:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:39:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:39:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:39:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:39:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:39:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:39:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:39:30,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:30,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901069511] [2024-10-11 02:39:30,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901069511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:30,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:30,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:39:30,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739345823] [2024-10-11 02:39:30,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:30,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:39:30,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:30,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:39:30,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:39:30,676 INFO L87 Difference]: Start difference. First operand 541 states and 889 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:39:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:35,567 INFO L93 Difference]: Finished difference Result 1398 states and 2384 transitions. [2024-10-11 02:39:35,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:39:35,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-11 02:39:35,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:35,573 INFO L225 Difference]: With dead ends: 1398 [2024-10-11 02:39:35,573 INFO L226 Difference]: Without dead ends: 867 [2024-10-11 02:39:35,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:39:35,577 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 1024 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 2890 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 3165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:35,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1531 Invalid, 3165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2890 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-11 02:39:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-10-11 02:39:35,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 541. [2024-10-11 02:39:35,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 410 states have (on average 1.6560975609756097) internal successors, (679), 426 states have internal predecessors, (679), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:39:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 888 transitions. [2024-10-11 02:39:35,711 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 888 transitions. Word has length 95 [2024-10-11 02:39:35,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:35,711 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 888 transitions. [2024-10-11 02:39:35,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:39:35,712 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 888 transitions. [2024-10-11 02:39:35,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:39:35,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:35,715 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-10-11 02:39:35,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:39:35,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:35,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:35,715 INFO L85 PathProgramCache]: Analyzing trace with hash -53813904, now seen corresponding path program 1 times [2024-10-11 02:39:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:35,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554880182] [2024-10-11 02:39:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:36,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:36,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:36,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:36,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:36,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:36,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:39:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:36,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:39:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:36,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:39:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:36,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:39:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:36,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:39:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:36,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:39:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:36,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:39:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:39:36,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:36,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554880182] [2024-10-11 02:39:36,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554880182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:36,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:36,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:39:36,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228998524] [2024-10-11 02:39:36,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:36,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:39:36,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:36,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:39:36,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:39:36,343 INFO L87 Difference]: Start difference. First operand 541 states and 888 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:39:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:42,360 INFO L93 Difference]: Finished difference Result 1404 states and 2388 transitions. [2024-10-11 02:39:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:39:42,361 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 96 [2024-10-11 02:39:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:42,366 INFO L225 Difference]: With dead ends: 1404 [2024-10-11 02:39:42,366 INFO L226 Difference]: Without dead ends: 873 [2024-10-11 02:39:42,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:39:42,369 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 2035 mSDsluCounter, 2378 mSDsCounter, 0 mSdLazyCounter, 5192 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 5865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 5192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:42,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 2826 Invalid, 5865 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [673 Valid, 5192 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 02:39:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-10-11 02:39:42,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 547. [2024-10-11 02:39:42,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 416 states have (on average 1.6466346153846154) internal successors, (685), 432 states have internal predecessors, (685), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:39:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 894 transitions. [2024-10-11 02:39:42,519 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 894 transitions. Word has length 96 [2024-10-11 02:39:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:42,519 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 894 transitions. [2024-10-11 02:39:42,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:39:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 894 transitions. [2024-10-11 02:39:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:39:42,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:42,522 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-10-11 02:39:42,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:39:42,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:42,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1269967630, now seen corresponding path program 1 times [2024-10-11 02:39:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:42,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525944073] [2024-10-11 02:39:42,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:42,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:42,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:42,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:42,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:43,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:43,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:43,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:39:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:43,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:39:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:43,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:39:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:43,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:39:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:43,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:39:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:43,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:39:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:43,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:39:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:39:43,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:43,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525944073] [2024-10-11 02:39:43,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525944073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:43,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:43,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:39:43,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572011143] [2024-10-11 02:39:43,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:43,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:39:43,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:43,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:39:43,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:39:43,117 INFO L87 Difference]: Start difference. First operand 547 states and 894 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)