./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_spec9_product28.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_spec9_product28.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 339ae17141354782861ad14ce1f1515b53735bca35311ebbaf6a68a6022f4172 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:39:25,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:39:25,226 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:39:25,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:39:25,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:39:25,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:39:25,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:39:25,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:39:25,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:39:25,266 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:39:25,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:39:25,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:39:25,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:39:25,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:39:25,270 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:39:25,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:39:25,271 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:39:25,271 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:39:25,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:39:25,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:39:25,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:39:25,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:39:25,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:39:25,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:39:25,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:39:25,277 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:39:25,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:39:25,277 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:39:25,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:39:25,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:39:25,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:39:25,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:39:25,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:39:25,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:39:25,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:39:25,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:39:25,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:39:25,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:39:25,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:39:25,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:39:25,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:39:25,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:39:25,282 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 -> 339ae17141354782861ad14ce1f1515b53735bca35311ebbaf6a68a6022f4172 [2024-10-11 02:39:25,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:39:25,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:39:25,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:39:25,559 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:39:25,560 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:39:25,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c [2024-10-11 02:39:27,002 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:39:27,301 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:39:27,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c [2024-10-11 02:39:27,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f02fd8017/e2a08cbd6be94c7d988be0ee5baf783a/FLAG1478c5770 [2024-10-11 02:39:27,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f02fd8017/e2a08cbd6be94c7d988be0ee5baf783a [2024-10-11 02:39:27,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:39:27,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:39:27,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:39:27,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:39:27,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:39:27,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:39:27" (1/1) ... [2024-10-11 02:39:27,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd45e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:27, skipping insertion in model container [2024-10-11 02:39:27,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:39:27" (1/1) ... [2024-10-11 02:39:27,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:39:27,980 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_spec9_product28.cil.c[73050,73063] [2024-10-11 02:39:27,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:39:28,000 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:39:28,010 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2024-10-11 02:39:28,011 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [716] [2024-10-11 02:39:28,012 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [837] [2024-10-11 02:39:28,012 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [875] [2024-10-11 02:39:28,012 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2483] [2024-10-11 02:39:28,012 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [2849] [2024-10-11 02:39:28,012 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3009] [2024-10-11 02:39:28,012 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3361] [2024-10-11 02:39:28,013 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3373] [2024-10-11 02:39:28,013 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3464] [2024-10-11 02:39:28,186 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_spec9_product28.cil.c[73050,73063] [2024-10-11 02:39:28,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:39:28,212 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:39:28,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:28 WrapperNode [2024-10-11 02:39:28,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:39:28,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:39:28,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:39:28,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:39:28,221 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:39:28" (1/1) ... [2024-10-11 02:39:28,244 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:39:28" (1/1) ... [2024-10-11 02:39:28,292 INFO L138 Inliner]: procedures = 97, calls = 345, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 1130 [2024-10-11 02:39:28,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:39:28,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:39:28,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:39:28,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:39:28,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:28" (1/1) ... [2024-10-11 02:39:28,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:28" (1/1) ... [2024-10-11 02:39:28,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:28" (1/1) ... [2024-10-11 02:39:28,355 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 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:39:28,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:28" (1/1) ... [2024-10-11 02:39:28,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:28" (1/1) ... [2024-10-11 02:39:28,381 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:28" (1/1) ... [2024-10-11 02:39:28,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:28" (1/1) ... [2024-10-11 02:39:28,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:28" (1/1) ... [2024-10-11 02:39:28,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:28" (1/1) ... [2024-10-11 02:39:28,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:39:28,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:39:28,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:39:28,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:39:28,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:28" (1/1) ... [2024-10-11 02:39:28,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:39:28,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:39:28,469 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:39:28,472 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:39:28,523 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-11 02:39:28,523 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-11 02:39:28,523 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:39:28,523 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:39:28,524 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:39:28,524 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:39:28,524 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:39:28,524 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:39:28,525 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:39:28,526 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:39:28,526 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:39:28,526 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:39:28,526 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-11 02:39:28,526 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-11 02:39:28,526 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:39:28,527 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:39:28,527 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:39:28,527 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:39:28,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:39:28,529 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:39:28,529 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:39:28,529 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-11 02:39:28,530 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-11 02:39:28,530 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:39:28,530 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:39:28,530 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:39:28,531 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:39:28,531 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-11 02:39:28,531 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-11 02:39:28,531 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:39:28,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:39:28,531 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:39:28,531 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:39:28,531 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:39:28,532 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:39:28,532 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-10-11 02:39:28,532 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-10-11 02:39:28,532 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:39:28,532 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:39:28,532 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:39:28,533 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:39:28,533 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:39:28,533 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:39:28,533 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:39:28,533 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:39:28,533 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-10-11 02:39:28,533 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-10-11 02:39:28,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:39:28,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:39:28,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:39:28,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:39:28,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:39:28,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:39:28,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:39:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:39:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:39:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:39:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:39:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:39:28,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:39:28,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:39:28,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:39:28,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:39:28,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:39:28,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:39:28,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:39:28,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:39:28,537 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:39:28,537 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:39:28,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:39:28,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:39:28,537 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:39:28,537 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:39:28,538 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-10-11 02:39:28,538 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-10-11 02:39:28,736 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:39:28,738 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:39:29,931 INFO L? ?]: Removed 456 outVars from TransFormulas that were not future-live. [2024-10-11 02:39:29,932 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:39:30,030 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:39:30,031 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:39:30,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:30 BoogieIcfgContainer [2024-10-11 02:39:30,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:39:30,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:39:30,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:39:30,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:39:30,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:39:27" (1/3) ... [2024-10-11 02:39:30,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62313388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:39:30, skipping insertion in model container [2024-10-11 02:39:30,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:28" (2/3) ... [2024-10-11 02:39:30,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62313388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:39:30, skipping insertion in model container [2024-10-11 02:39:30,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:30" (3/3) ... [2024-10-11 02:39:30,041 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product28.cil.c [2024-10-11 02:39:30,058 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:39:30,059 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:39:30,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:39:30,159 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;@6939449f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:39:30,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:39:30,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 551 states, 426 states have (on average 1.7230046948356808) internal successors, (734), 449 states have internal predecessors, (734), 97 states have call successors, (97), 26 states have call predecessors, (97), 26 states have return successors, (97), 90 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-11 02:39:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 02:39:30,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:30,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:30,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:30,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:30,194 INFO L85 PathProgramCache]: Analyzing trace with hash -464883476, now seen corresponding path program 1 times [2024-10-11 02:39:30,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:30,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425440493] [2024-10-11 02:39:30,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:30,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:31,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:39:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:31,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:31,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:31,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:39:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:31,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:39:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:31,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:31,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425440493] [2024-10-11 02:39:31,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425440493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:31,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:31,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:39:31,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393481643] [2024-10-11 02:39:31,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:31,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:39:31,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:31,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:39:31,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:39:31,517 INFO L87 Difference]: Start difference. First operand has 551 states, 426 states have (on average 1.7230046948356808) internal successors, (734), 449 states have internal predecessors, (734), 97 states have call successors, (97), 26 states have call predecessors, (97), 26 states have return successors, (97), 90 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:39:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:36,594 INFO L93 Difference]: Finished difference Result 1238 states and 2112 transitions. [2024-10-11 02:39:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:39:36,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2024-10-11 02:39:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:36,619 INFO L225 Difference]: With dead ends: 1238 [2024-10-11 02:39:36,619 INFO L226 Difference]: Without dead ends: 696 [2024-10-11 02:39:36,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:39:36,633 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 684 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 2785 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:36,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1015 Invalid, 2907 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [122 Valid, 2785 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-11 02:39:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-10-11 02:39:36,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 547. [2024-10-11 02:39:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 424 states have (on average 1.7122641509433962) internal successors, (726), 445 states have internal predecessors, (726), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 02:39:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 915 transitions. [2024-10-11 02:39:36,825 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 915 transitions. Word has length 52 [2024-10-11 02:39:36,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:36,826 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 915 transitions. [2024-10-11 02:39:36,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:39:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 915 transitions. [2024-10-11 02:39:36,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 02:39:36,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:36,830 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:36,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:39:36,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:36,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:36,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2113347507, now seen corresponding path program 1 times [2024-10-11 02:39:36,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:36,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850790982] [2024-10-11 02:39:36,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:36,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:39:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:39:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:39:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:39:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:37,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:37,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850790982] [2024-10-11 02:39:37,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850790982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:37,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:37,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:39:37,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202770264] [2024-10-11 02:39:37,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:37,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:39:37,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:37,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:39:37,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:39:37,523 INFO L87 Difference]: Start difference. First operand 547 states and 915 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:39:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:42,089 INFO L93 Difference]: Finished difference Result 1231 states and 2085 transitions. [2024-10-11 02:39:42,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:39:42,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-10-11 02:39:42,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:42,100 INFO L225 Difference]: With dead ends: 1231 [2024-10-11 02:39:42,101 INFO L226 Difference]: Without dead ends: 696 [2024-10-11 02:39:42,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:39:42,107 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 1142 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 2623 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 2889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 2623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:42,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1225 Valid, 1004 Invalid, 2889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 2623 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 02:39:42,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-10-11 02:39:42,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 547. [2024-10-11 02:39:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 424 states have (on average 1.7099056603773586) internal successors, (725), 445 states have internal predecessors, (725), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 02:39:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 914 transitions. [2024-10-11 02:39:42,213 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 914 transitions. Word has length 54 [2024-10-11 02:39:42,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:42,213 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 914 transitions. [2024-10-11 02:39:42,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:39:42,214 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 914 transitions. [2024-10-11 02:39:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 02:39:42,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:42,216 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:42,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:39:42,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:42,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:42,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1053526157, now seen corresponding path program 1 times [2024-10-11 02:39:42,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:42,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267534419] [2024-10-11 02:39:42,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:42,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:42,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:42,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:42,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:42,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:39:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:42,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:42,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:42,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:39:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:42,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:39:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:42,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:42,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267534419] [2024-10-11 02:39:42,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267534419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:42,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:42,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:39:42,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545179805] [2024-10-11 02:39:42,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:42,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:39:42,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:42,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:39:42,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:39:42,833 INFO L87 Difference]: Start difference. First operand 547 states and 914 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:39:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:46,768 INFO L93 Difference]: Finished difference Result 1231 states and 2084 transitions. [2024-10-11 02:39:46,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:39:46,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2024-10-11 02:39:46,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:46,774 INFO L225 Difference]: With dead ends: 1231 [2024-10-11 02:39:46,774 INFO L226 Difference]: Without dead ends: 696 [2024-10-11 02:39:46,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:39:46,778 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1132 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2641 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 2891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 2641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:46,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 1040 Invalid, 2891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 2641 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 02:39:46,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-10-11 02:39:46,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 547. [2024-10-11 02:39:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 424 states have (on average 1.7075471698113207) internal successors, (724), 445 states have internal predecessors, (724), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 02:39:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 913 transitions. [2024-10-11 02:39:46,867 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 913 transitions. Word has length 55 [2024-10-11 02:39:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:46,868 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 913 transitions. [2024-10-11 02:39:46,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:39:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 913 transitions. [2024-10-11 02:39:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 02:39:46,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:46,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:46,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:39:46,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:46,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:46,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1148538697, now seen corresponding path program 1 times [2024-10-11 02:39:46,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:46,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011282349] [2024-10-11 02:39:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:46,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:47,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:47,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:47,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:39:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:39:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:47,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:47,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:39:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:47,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:39:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:47,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:47,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011282349] [2024-10-11 02:39:47,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011282349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:47,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:47,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:39:47,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274925513] [2024-10-11 02:39:47,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:47,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:39:47,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:47,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:39:47,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:39:47,500 INFO L87 Difference]: Start difference. First operand 547 states and 913 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:39:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:51,529 INFO L93 Difference]: Finished difference Result 1231 states and 2083 transitions. [2024-10-11 02:39:51,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:39:51,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2024-10-11 02:39:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:51,534 INFO L225 Difference]: With dead ends: 1231 [2024-10-11 02:39:51,534 INFO L226 Difference]: Without dead ends: 696 [2024-10-11 02:39:51,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:39:51,538 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1130 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:51,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 1034 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:39:51,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-10-11 02:39:51,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 547. [2024-10-11 02:39:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 424 states have (on average 1.705188679245283) internal successors, (723), 445 states have internal predecessors, (723), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 02:39:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 912 transitions. [2024-10-11 02:39:51,619 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 912 transitions. Word has length 56 [2024-10-11 02:39:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:51,620 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 912 transitions. [2024-10-11 02:39:51,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:39:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 912 transitions. [2024-10-11 02:39:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 02:39:51,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:51,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:51,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:39:51,622 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:51,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:51,622 INFO L85 PathProgramCache]: Analyzing trace with hash -505136905, now seen corresponding path program 1 times [2024-10-11 02:39:51,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:51,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135114095] [2024-10-11 02:39:51,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:51,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:51,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:51,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:51,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:39:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:52,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:39:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:52,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:52,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:52,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:39:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:52,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:39:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:52,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135114095] [2024-10-11 02:39:52,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135114095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:52,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:52,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:39:52,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327581881] [2024-10-11 02:39:52,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:52,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:39:52,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:52,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:39:52,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:39:52,204 INFO L87 Difference]: Start difference. First operand 547 states and 912 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:39:56,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:56,279 INFO L93 Difference]: Finished difference Result 1231 states and 2082 transitions. [2024-10-11 02:39:56,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:39:56,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2024-10-11 02:39:56,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:56,284 INFO L225 Difference]: With dead ends: 1231 [2024-10-11 02:39:56,285 INFO L226 Difference]: Without dead ends: 696 [2024-10-11 02:39:56,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:39:56,288 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 675 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 2783 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 2900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:56,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1027 Invalid, 2900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2783 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:39:56,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-10-11 02:39:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 547. [2024-10-11 02:39:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 424 states have (on average 1.7028301886792452) internal successors, (722), 445 states have internal predecessors, (722), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 02:39:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 911 transitions. [2024-10-11 02:39:56,377 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 911 transitions. Word has length 57 [2024-10-11 02:39:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:56,378 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 911 transitions. [2024-10-11 02:39:56,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:39:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 911 transitions. [2024-10-11 02:39:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 02:39:56,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:56,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:56,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:39:56,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:56,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:56,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1554272699, now seen corresponding path program 1 times [2024-10-11 02:39:56,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:56,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832025013] [2024-10-11 02:39:56,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:56,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:56,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:56,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:56,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:39:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:57,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:39:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:57,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:57,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:57,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:39:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:57,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:39:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:57,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:57,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:57,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832025013] [2024-10-11 02:39:57,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832025013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:57,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:57,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:39:57,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337336667] [2024-10-11 02:39:57,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:57,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:39:57,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:57,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:39:57,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:39:57,068 INFO L87 Difference]: Start difference. First operand 547 states and 911 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:00,798 INFO L93 Difference]: Finished difference Result 1201 states and 2021 transitions. [2024-10-11 02:40:00,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:40:00,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2024-10-11 02:40:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:00,804 INFO L225 Difference]: With dead ends: 1201 [2024-10-11 02:40:00,804 INFO L226 Difference]: Without dead ends: 706 [2024-10-11 02:40:00,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:40:00,807 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 735 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 2741 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:00,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 1021 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 2741 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:40:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-10-11 02:40:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 547. [2024-10-11 02:40:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 424 states have (on average 1.6910377358490567) internal successors, (717), 445 states have internal predecessors, (717), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 02:40:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 906 transitions. [2024-10-11 02:40:00,896 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 906 transitions. Word has length 58 [2024-10-11 02:40:00,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:00,896 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 906 transitions. [2024-10-11 02:40:00,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 906 transitions. [2024-10-11 02:40:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 02:40:00,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:00,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:00,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:40:00,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:00,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:00,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1638036621, now seen corresponding path program 1 times [2024-10-11 02:40:00,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:00,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176902601] [2024-10-11 02:40:00,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:00,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:40:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:40:01,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:01,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176902601] [2024-10-11 02:40:01,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176902601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:01,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:01,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 02:40:01,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743165070] [2024-10-11 02:40:01,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:01,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 02:40:01,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:01,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 02:40:01,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:40:01,675 INFO L87 Difference]: Start difference. First operand 547 states and 906 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:40:09,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:09,821 INFO L93 Difference]: Finished difference Result 1229 states and 2068 transitions. [2024-10-11 02:40:09,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 02:40:09,822 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 59 [2024-10-11 02:40:09,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:09,828 INFO L225 Difference]: With dead ends: 1229 [2024-10-11 02:40:09,828 INFO L226 Difference]: Without dead ends: 742 [2024-10-11 02:40:09,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2024-10-11 02:40:09,832 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 826 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 8838 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 3261 SdHoareTripleChecker+Invalid, 8967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 8838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:09,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 3261 Invalid, 8967 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [129 Valid, 8838 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-11 02:40:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-10-11 02:40:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 563. [2024-10-11 02:40:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 436 states have (on average 1.68348623853211) internal successors, (734), 459 states have internal predecessors, (734), 98 states have call successors, (98), 26 states have call predecessors, (98), 28 states have return successors, (97), 91 states have call predecessors, (97), 93 states have call successors, (97) [2024-10-11 02:40:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 929 transitions. [2024-10-11 02:40:09,952 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 929 transitions. Word has length 59 [2024-10-11 02:40:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:09,954 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 929 transitions. [2024-10-11 02:40:09,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:40:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 929 transitions. [2024-10-11 02:40:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 02:40:09,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:09,956 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] [2024-10-11 02:40:09,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:40:09,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:09,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:09,959 INFO L85 PathProgramCache]: Analyzing trace with hash 280619609, now seen corresponding path program 1 times [2024-10-11 02:40:09,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:09,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347268862] [2024-10-11 02:40:09,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:09,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:40:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:40:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,567 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:40:10,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:10,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347268862] [2024-10-11 02:40:10,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347268862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:10,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:10,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:40:10,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252152558] [2024-10-11 02:40:10,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:10,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:40:10,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:10,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:40:10,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:40:10,570 INFO L87 Difference]: Start difference. First operand 563 states and 929 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:40:14,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:14,214 INFO L93 Difference]: Finished difference Result 1239 states and 2075 transitions. [2024-10-11 02:40:14,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:40:14,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2024-10-11 02:40:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:14,221 INFO L225 Difference]: With dead ends: 1239 [2024-10-11 02:40:14,221 INFO L226 Difference]: Without dead ends: 732 [2024-10-11 02:40:14,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:40:14,224 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 734 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:14,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1006 Invalid, 2839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 02:40:14,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-10-11 02:40:14,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 563. [2024-10-11 02:40:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 436 states have (on average 1.6720183486238531) internal successors, (729), 459 states have internal predecessors, (729), 98 states have call successors, (98), 26 states have call predecessors, (98), 28 states have return successors, (97), 91 states have call predecessors, (97), 93 states have call successors, (97) [2024-10-11 02:40:14,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 924 transitions. [2024-10-11 02:40:14,342 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 924 transitions. Word has length 64 [2024-10-11 02:40:14,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:14,343 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 924 transitions. [2024-10-11 02:40:14,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:40:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 924 transitions. [2024-10-11 02:40:14,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 02:40:14,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:14,345 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] [2024-10-11 02:40:14,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:40:14,345 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:14,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:14,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1777844558, now seen corresponding path program 1 times [2024-10-11 02:40:14,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:14,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729772899] [2024-10-11 02:40:14,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:14,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:40:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:40:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,849 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:40:14,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:14,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729772899] [2024-10-11 02:40:14,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729772899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:14,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:14,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:40:14,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090226807] [2024-10-11 02:40:14,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:14,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:40:14,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:14,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:40:14,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:40:14,852 INFO L87 Difference]: Start difference. First operand 563 states and 924 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:40:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:18,210 INFO L93 Difference]: Finished difference Result 1239 states and 2070 transitions. [2024-10-11 02:40:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:40:18,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2024-10-11 02:40:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:18,216 INFO L225 Difference]: With dead ends: 1239 [2024-10-11 02:40:18,216 INFO L226 Difference]: Without dead ends: 732 [2024-10-11 02:40:18,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:40:18,219 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1196 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:18,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 998 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 02:40:18,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-10-11 02:40:18,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 563. [2024-10-11 02:40:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 436 states have (on average 1.6605504587155964) internal successors, (724), 459 states have internal predecessors, (724), 98 states have call successors, (98), 26 states have call predecessors, (98), 28 states have return successors, (97), 91 states have call predecessors, (97), 93 states have call successors, (97) [2024-10-11 02:40:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 919 transitions. [2024-10-11 02:40:18,319 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 919 transitions. Word has length 65 [2024-10-11 02:40:18,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:18,320 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 919 transitions. [2024-10-11 02:40:18,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:40:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 919 transitions. [2024-10-11 02:40:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 02:40:18,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:18,322 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] [2024-10-11 02:40:18,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:40:18,323 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:18,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1033409918, now seen corresponding path program 1 times [2024-10-11 02:40:18,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:18,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982682088] [2024-10-11 02:40:18,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:18,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:40:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:40:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,840 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:40:18,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:18,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982682088] [2024-10-11 02:40:18,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982682088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:18,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:18,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:40:18,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493905073] [2024-10-11 02:40:18,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:18,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:40:18,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:18,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:40:18,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:40:18,842 INFO L87 Difference]: Start difference. First operand 563 states and 919 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:40:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:22,241 INFO L93 Difference]: Finished difference Result 1239 states and 2065 transitions. [2024-10-11 02:40:22,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:40:22,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2024-10-11 02:40:22,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:22,246 INFO L225 Difference]: With dead ends: 1239 [2024-10-11 02:40:22,246 INFO L226 Difference]: Without dead ends: 732 [2024-10-11 02:40:22,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:40:22,248 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 1195 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 2525 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 2794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:22,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 992 Invalid, 2794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2525 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 02:40:22,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-10-11 02:40:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 563. [2024-10-11 02:40:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 436 states have (on average 1.6490825688073394) internal successors, (719), 459 states have internal predecessors, (719), 98 states have call successors, (98), 26 states have call predecessors, (98), 28 states have return successors, (97), 91 states have call predecessors, (97), 93 states have call successors, (97) [2024-10-11 02:40:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 914 transitions. [2024-10-11 02:40:22,344 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 914 transitions. Word has length 66 [2024-10-11 02:40:22,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:22,345 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 914 transitions. [2024-10-11 02:40:22,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:40:22,345 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 914 transitions. [2024-10-11 02:40:22,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 02:40:22,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:22,346 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] [2024-10-11 02:40:22,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:40:22,347 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:22,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:22,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1945986081, now seen corresponding path program 1 times [2024-10-11 02:40:22,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:22,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423598194] [2024-10-11 02:40:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:22,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:22,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:22,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:22,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:22,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:40:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:22,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:22,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:22,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:22,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:22,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:40:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:22,897 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:40:22,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:22,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423598194] [2024-10-11 02:40:22,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423598194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:22,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:22,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:40:22,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895822126] [2024-10-11 02:40:22,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:22,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:40:22,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:22,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:40:22,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:40:22,900 INFO L87 Difference]: Start difference. First operand 563 states and 914 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:40:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:26,689 INFO L93 Difference]: Finished difference Result 1265 states and 2091 transitions. [2024-10-11 02:40:26,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:40:26,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2024-10-11 02:40:26,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:26,694 INFO L225 Difference]: With dead ends: 1265 [2024-10-11 02:40:26,694 INFO L226 Difference]: Without dead ends: 675 [2024-10-11 02:40:26,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:40:26,697 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 672 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 2665 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 2784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:26,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 988 Invalid, 2784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2665 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 02:40:26,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-10-11 02:40:26,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 524. [2024-10-11 02:40:26,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 400 states have (on average 1.66) internal successors, (664), 421 states have internal predecessors, (664), 97 states have call successors, (97), 26 states have call predecessors, (97), 26 states have return successors, (94), 90 states have call predecessors, (94), 92 states have call successors, (94) [2024-10-11 02:40:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 855 transitions. [2024-10-11 02:40:26,791 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 855 transitions. Word has length 66 [2024-10-11 02:40:26,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:26,792 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 855 transitions. [2024-10-11 02:40:26,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:40:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 855 transitions. [2024-10-11 02:40:26,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 02:40:26,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:26,793 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] [2024-10-11 02:40:26,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:40:26,793 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:26,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:26,794 INFO L85 PathProgramCache]: Analyzing trace with hash 591506723, now seen corresponding path program 1 times [2024-10-11 02:40:26,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:26,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880882576] [2024-10-11 02:40:26,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:26,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:40:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:40:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,426 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:40:27,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:27,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880882576] [2024-10-11 02:40:27,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880882576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:27,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:27,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:40:27,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601413011] [2024-10-11 02:40:27,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:27,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:40:27,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:27,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:40:27,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:40:27,429 INFO L87 Difference]: Start difference. First operand 524 states and 855 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 02:40:35,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:35,693 INFO L93 Difference]: Finished difference Result 1451 states and 2412 transitions. [2024-10-11 02:40:35,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 02:40:35,694 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 68 [2024-10-11 02:40:35,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:35,699 INFO L225 Difference]: With dead ends: 1451 [2024-10-11 02:40:35,699 INFO L226 Difference]: Without dead ends: 958 [2024-10-11 02:40:35,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2024-10-11 02:40:35,701 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 1583 mSDsluCounter, 1835 mSDsCounter, 0 mSdLazyCounter, 8331 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 8680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 8331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:35,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 2110 Invalid, 8680 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [349 Valid, 8331 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-11 02:40:35,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-11 02:40:35,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 761. [2024-10-11 02:40:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 585 states have (on average 1.6495726495726495) internal successors, (965), 606 states have internal predecessors, (965), 135 states have call successors, (135), 39 states have call predecessors, (135), 40 states have return successors, (138), 129 states have call predecessors, (138), 130 states have call successors, (138) [2024-10-11 02:40:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1238 transitions. [2024-10-11 02:40:35,905 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1238 transitions. Word has length 68 [2024-10-11 02:40:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:35,905 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1238 transitions. [2024-10-11 02:40:35,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 02:40:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1238 transitions. [2024-10-11 02:40:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 02:40:35,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:35,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:35,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:40:35,907 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:35,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:35,907 INFO L85 PathProgramCache]: Analyzing trace with hash -108173827, now seen corresponding path program 1 times [2024-10-11 02:40:35,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:35,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592814009] [2024-10-11 02:40:35,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:35,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:36,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:36,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:36,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:36,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:40:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:36,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:36,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:36,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:36,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:40:36,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:36,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592814009] [2024-10-11 02:40:36,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592814009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:36,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:36,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:40:36,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046703586] [2024-10-11 02:40:36,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:36,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:40:36,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:36,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:40:36,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:40:36,426 INFO L87 Difference]: Start difference. First operand 761 states and 1238 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:39,696 INFO L93 Difference]: Finished difference Result 1677 states and 2775 transitions. [2024-10-11 02:40:39,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:40:39,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2024-10-11 02:40:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:39,704 INFO L225 Difference]: With dead ends: 1677 [2024-10-11 02:40:39,704 INFO L226 Difference]: Without dead ends: 941 [2024-10-11 02:40:39,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:40:39,722 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1063 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 2414 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 2663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 2414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:39,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1036 Invalid, 2663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 2414 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 02:40:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-10-11 02:40:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 761. [2024-10-11 02:40:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 585 states have (on average 1.6478632478632478) internal successors, (964), 606 states have internal predecessors, (964), 135 states have call successors, (135), 39 states have call predecessors, (135), 40 states have return successors, (138), 129 states have call predecessors, (138), 130 states have call successors, (138) [2024-10-11 02:40:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1237 transitions. [2024-10-11 02:40:39,889 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1237 transitions. Word has length 69 [2024-10-11 02:40:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:39,889 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1237 transitions. [2024-10-11 02:40:39,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1237 transitions. [2024-10-11 02:40:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 02:40:39,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:39,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:39,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:40:39,891 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:39,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:39,892 INFO L85 PathProgramCache]: Analyzing trace with hash 202196521, now seen corresponding path program 1 times [2024-10-11 02:40:39,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:39,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970461535] [2024-10-11 02:40:39,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:39,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:40,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:40,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:40,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:40:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:40,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:40,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:40,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:40,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:40:40,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:40,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970461535] [2024-10-11 02:40:40,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970461535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:40,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:40,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:40:40,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472770849] [2024-10-11 02:40:40,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:40,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:40:40,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:40,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:40:40,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:40:40,632 INFO L87 Difference]: Start difference. First operand 761 states and 1237 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8)