./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_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1493e9da3ad278988eda47a556733ebc5ac5411d3350d76fb478293d9e5d934e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:21:23,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:21:23,235 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:21:23,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:21:23,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:21:23,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:21:23,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:21:23,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:21:23,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:21:23,269 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:21:23,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:21:23,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:21:23,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:21:23,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:21:23,273 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:21:23,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:21:23,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:21:23,274 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:21:23,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:21:23,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:21:23,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:21:23,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:21:23,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:21:23,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:21:23,279 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:21:23,279 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:21:23,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:21:23,279 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:21:23,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:21:23,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:21:23,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:21:23,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:21:23,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:21:23,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:21:23,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:21:23,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:21:23,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:21:23,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:21:23,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:21:23,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:21:23,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:21:23,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:21:23,284 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/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/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 -> 1493e9da3ad278988eda47a556733ebc5ac5411d3350d76fb478293d9e5d934e [2024-10-12 19:21:23,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:21:23,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:21:23,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:21:23,555 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:21:23,556 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:21:23,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c [2024-10-12 19:21:25,023 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:21:25,366 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:21:25,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c [2024-10-12 19:21:25,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b881339c/0ae958ee8eda4ace852dcd814e17389b/FLAG36d59233c [2024-10-12 19:21:25,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b881339c/0ae958ee8eda4ace852dcd814e17389b [2024-10-12 19:21:25,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:21:25,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:21:25,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:21:25,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:21:25,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:21:25,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:21:25" (1/1) ... [2024-10-12 19:21:25,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63859c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:25, skipping insertion in model container [2024-10-12 19:21:25,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:21:25" (1/1) ... [2024-10-12 19:21:25,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:21:25,871 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_product30.cil.c[11768,11781] [2024-10-12 19:21:26,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:21:26,134 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:21:26,142 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2024-10-12 19:21:26,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [414] [2024-10-12 19:21:26,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [452] [2024-10-12 19:21:26,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [461] [2024-10-12 19:21:26,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [626] [2024-10-12 19:21:26,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [640] [2024-10-12 19:21:26,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [739] [2024-10-12 19:21:26,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [859] [2024-10-12 19:21:26,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2444] [2024-10-12 19:21:26,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3105] [2024-10-12 19:21:26,170 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_product30.cil.c[11768,11781] [2024-10-12 19:21:26,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:21:26,259 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:21:26,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:26 WrapperNode [2024-10-12 19:21:26,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:21:26,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:21:26,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:21:26,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:21:26,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:26" (1/1) ... [2024-10-12 19:21:26,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:26" (1/1) ... [2024-10-12 19:21:26,351 INFO L138 Inliner]: procedures = 95, calls = 344, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 872 [2024-10-12 19:21:26,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:21:26,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:21:26,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:21:26,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:21:26,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:26" (1/1) ... [2024-10-12 19:21:26,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:26" (1/1) ... [2024-10-12 19:21:26,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:26" (1/1) ... [2024-10-12 19:21:26,404 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-12 19:21:26,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:26" (1/1) ... [2024-10-12 19:21:26,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:26" (1/1) ... [2024-10-12 19:21:26,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:26" (1/1) ... [2024-10-12 19:21:26,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:26" (1/1) ... [2024-10-12 19:21:26,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:26" (1/1) ... [2024-10-12 19:21:26,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:26" (1/1) ... [2024-10-12 19:21:26,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:21:26,496 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:21:26,496 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:21:26,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:21:26,498 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:26" (1/1) ... [2024-10-12 19:21:26,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:21:26,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:21:26,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:21:26,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:21:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:21:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-12 19:21:26,591 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-12 19:21:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-12 19:21:26,591 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-12 19:21:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-12 19:21:26,591 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-12 19:21:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-12 19:21:26,591 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-12 19:21:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-12 19:21:26,592 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-12 19:21:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-10-12 19:21:26,592 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-10-12 19:21:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:21:26,593 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:21:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:21:26,594 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:21:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-12 19:21:26,594 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-12 19:21:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-12 19:21:26,594 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-12 19:21:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-12 19:21:26,595 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-12 19:21:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-12 19:21:26,595 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-12 19:21:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-12 19:21:26,597 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-12 19:21:26,597 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-12 19:21:26,598 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-12 19:21:26,598 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-12 19:21:26,598 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-12 19:21:26,598 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-12 19:21:26,598 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-12 19:21:26,598 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-12 19:21:26,598 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-12 19:21:26,599 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-12 19:21:26,599 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-12 19:21:26,599 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-12 19:21:26,599 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-12 19:21:26,599 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-10-12 19:21:26,599 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-10-12 19:21:26,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:21:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:21:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:21:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:21:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 19:21:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 19:21:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 19:21:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-12 19:21:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-12 19:21:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-12 19:21:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-12 19:21:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-12 19:21:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-12 19:21:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-12 19:21:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-12 19:21:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-12 19:21:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-12 19:21:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-12 19:21:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-12 19:21:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-12 19:21:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-12 19:21:26,602 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-12 19:21:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-12 19:21:26,602 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-12 19:21:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-12 19:21:26,602 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-12 19:21:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-12 19:21:26,603 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-12 19:21:26,603 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2024-10-12 19:21:26,603 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2024-10-12 19:21:26,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:21:26,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:21:26,603 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-12 19:21:26,603 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-12 19:21:26,804 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:21:26,807 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:21:27,972 INFO L? ?]: Removed 455 outVars from TransFormulas that were not future-live. [2024-10-12 19:21:27,973 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:21:28,061 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:21:28,062 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:21:28,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:21:28 BoogieIcfgContainer [2024-10-12 19:21:28,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:21:28,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:21:28,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:21:28,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:21:28,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:21:25" (1/3) ... [2024-10-12 19:21:28,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edba7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:21:28, skipping insertion in model container [2024-10-12 19:21:28,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:26" (2/3) ... [2024-10-12 19:21:28,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edba7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:21:28, skipping insertion in model container [2024-10-12 19:21:28,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:21:28" (3/3) ... [2024-10-12 19:21:28,070 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product30.cil.c [2024-10-12 19:21:28,085 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:21:28,086 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:21:28,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:21:28,181 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;@2090568d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:21:28,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:21:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 555 states, 431 states have (on average 1.7262180974477959) internal successors, (744), 454 states have internal predecessors, (744), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-12 19:21:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 19:21:28,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:28,208 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-12 19:21:28,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:28,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:28,215 INFO L85 PathProgramCache]: Analyzing trace with hash 984736199, now seen corresponding path program 1 times [2024-10-12 19:21:28,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:28,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242442572] [2024-10-12 19:21:28,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:28,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:28,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:28,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:28,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:21:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:21:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:21:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:21:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,502 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-12 19:21:29,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:29,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242442572] [2024-10-12 19:21:29,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242442572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:29,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:29,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:21:29,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719489781] [2024-10-12 19:21:29,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:29,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:21:29,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:29,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:21:29,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:21:29,539 INFO L87 Difference]: Start difference. First operand has 555 states, 431 states have (on average 1.7262180974477959) internal successors, (744), 454 states have internal predecessors, (744), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) 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-12 19:21:34,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:34,552 INFO L93 Difference]: Finished difference Result 1246 states and 2128 transitions. [2024-10-12 19:21:34,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:21:34,555 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-12 19:21:34,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:34,574 INFO L225 Difference]: With dead ends: 1246 [2024-10-12 19:21:34,574 INFO L226 Difference]: Without dead ends: 700 [2024-10-12 19:21:34,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:21:34,590 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 693 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 2806 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 2929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:34,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1009 Invalid, 2929 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [123 Valid, 2806 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-12 19:21:34,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-12 19:21:34,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 551. [2024-10-12 19:21:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 429 states have (on average 1.7156177156177157) internal successors, (736), 450 states have internal predecessors, (736), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-12 19:21:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 923 transitions. [2024-10-12 19:21:34,836 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 923 transitions. Word has length 52 [2024-10-12 19:21:34,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:34,838 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 923 transitions. [2024-10-12 19:21:34,839 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-12 19:21:34,839 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 923 transitions. [2024-10-12 19:21:34,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 19:21:34,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:34,846 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-12 19:21:34,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:21:34,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:34,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:34,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1854082318, now seen corresponding path program 1 times [2024-10-12 19:21:34,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:34,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735834587] [2024-10-12 19:21:34,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:34,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:21:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:21:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:21:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:21:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,458 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-12 19:21:35,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:35,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735834587] [2024-10-12 19:21:35,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735834587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:35,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:35,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:21:35,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897821837] [2024-10-12 19:21:35,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:35,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:21:35,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:35,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:21:35,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:21:35,462 INFO L87 Difference]: Start difference. First operand 551 states and 923 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-12 19:21:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:40,381 INFO L93 Difference]: Finished difference Result 1239 states and 2101 transitions. [2024-10-12 19:21:40,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:21:40,381 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-12 19:21:40,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:40,389 INFO L225 Difference]: With dead ends: 1239 [2024-10-12 19:21:40,389 INFO L226 Difference]: Without dead ends: 700 [2024-10-12 19:21:40,392 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-12 19:21:40,393 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 690 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 2802 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:40,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1015 Invalid, 2923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2802 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-12 19:21:40,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-12 19:21:40,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 551. [2024-10-12 19:21:40,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 429 states have (on average 1.7132867132867133) internal successors, (735), 450 states have internal predecessors, (735), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-12 19:21:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 922 transitions. [2024-10-12 19:21:40,489 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 922 transitions. Word has length 54 [2024-10-12 19:21:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:40,490 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 922 transitions. [2024-10-12 19:21:40,490 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-12 19:21:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 922 transitions. [2024-10-12 19:21:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 19:21:40,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:40,493 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-12 19:21:40,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:21:40,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:40,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:40,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2129810193, now seen corresponding path program 1 times [2024-10-12 19:21:40,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:40,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388641171] [2024-10-12 19:21:40,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:40,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:40,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:40,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:40,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:21:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:41,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 19:21:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:41,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:41,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:41,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:21:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:41,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:21:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:41,127 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-12 19:21:41,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:41,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388641171] [2024-10-12 19:21:41,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388641171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:41,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:41,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:21:41,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835535585] [2024-10-12 19:21:41,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:41,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:21:41,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:41,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:21:41,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:21:41,134 INFO L87 Difference]: Start difference. First operand 551 states and 922 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-12 19:21:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:45,468 INFO L93 Difference]: Finished difference Result 1239 states and 2100 transitions. [2024-10-12 19:21:45,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:21:45,469 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-12 19:21:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:45,475 INFO L225 Difference]: With dead ends: 1239 [2024-10-12 19:21:45,475 INFO L226 Difference]: Without dead ends: 700 [2024-10-12 19:21:45,479 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-12 19:21:45,480 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 688 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:45,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1006 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2795 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-12 19:21:45,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-12 19:21:45,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 551. [2024-10-12 19:21:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 429 states have (on average 1.710955710955711) internal successors, (734), 450 states have internal predecessors, (734), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-12 19:21:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 921 transitions. [2024-10-12 19:21:45,575 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 921 transitions. Word has length 55 [2024-10-12 19:21:45,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:45,575 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 921 transitions. [2024-10-12 19:21:45,579 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-12 19:21:45,579 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 921 transitions. [2024-10-12 19:21:45,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 19:21:45,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:45,580 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-12 19:21:45,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:21:45,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:45,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:45,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1381262962, now seen corresponding path program 1 times [2024-10-12 19:21:45,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:45,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203441082] [2024-10-12 19:21:45,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:45,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:45,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:45,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:45,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:21:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:46,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:21:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:46,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:46,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:46,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:21:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:46,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:21:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:46,196 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-12 19:21:46,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:46,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203441082] [2024-10-12 19:21:46,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203441082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:46,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:46,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:21:46,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267953313] [2024-10-12 19:21:46,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:46,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:21:46,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:46,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:21:46,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:21:46,198 INFO L87 Difference]: Start difference. First operand 551 states and 921 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-12 19:21:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:50,327 INFO L93 Difference]: Finished difference Result 1239 states and 2099 transitions. [2024-10-12 19:21:50,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:21:50,328 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-12 19:21:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:50,333 INFO L225 Difference]: With dead ends: 1239 [2024-10-12 19:21:50,333 INFO L226 Difference]: Without dead ends: 700 [2024-10-12 19:21:50,336 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-12 19:21:50,337 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 686 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:50,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1015 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-12 19:21:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-12 19:21:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 551. [2024-10-12 19:21:50,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 429 states have (on average 1.7086247086247086) internal successors, (733), 450 states have internal predecessors, (733), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-12 19:21:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 920 transitions. [2024-10-12 19:21:50,422 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 920 transitions. Word has length 56 [2024-10-12 19:21:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:50,423 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 920 transitions. [2024-10-12 19:21:50,423 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-12 19:21:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 920 transitions. [2024-10-12 19:21:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 19:21:50,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:50,425 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-12 19:21:50,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:21:50,426 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:50,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1055041483, now seen corresponding path program 1 times [2024-10-12 19:21:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:50,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243512774] [2024-10-12 19:21:50,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:50,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:50,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:50,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:50,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:21:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:51,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:21:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:51,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:51,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:51,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:21:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:51,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:21:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:51,093 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-12 19:21:51,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:51,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243512774] [2024-10-12 19:21:51,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243512774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:51,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:51,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:21:51,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108222141] [2024-10-12 19:21:51,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:51,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:21:51,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:51,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:21:51,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:21:51,098 INFO L87 Difference]: Start difference. First operand 551 states and 920 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-12 19:21:54,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:54,756 INFO L93 Difference]: Finished difference Result 1239 states and 2098 transitions. [2024-10-12 19:21:54,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:21:54,757 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-12 19:21:54,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:54,762 INFO L225 Difference]: With dead ends: 1239 [2024-10-12 19:21:54,762 INFO L226 Difference]: Without dead ends: 700 [2024-10-12 19:21:54,765 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-12 19:21:54,766 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 1149 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 2641 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 2900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 2641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:54,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 1019 Invalid, 2900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 2641 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 19:21:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-12 19:21:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 551. [2024-10-12 19:21:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 429 states have (on average 1.7062937062937062) internal successors, (732), 450 states have internal predecessors, (732), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-12 19:21:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 919 transitions. [2024-10-12 19:21:54,863 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 919 transitions. Word has length 57 [2024-10-12 19:21:54,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:54,864 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 919 transitions. [2024-10-12 19:21:54,864 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-12 19:21:54,864 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 919 transitions. [2024-10-12 19:21:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 19:21:54,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:54,866 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-12 19:21:54,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:21:54,866 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:54,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:54,867 INFO L85 PathProgramCache]: Analyzing trace with hash 22755286, now seen corresponding path program 1 times [2024-10-12 19:21:54,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:54,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10911001] [2024-10-12 19:21:54,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:54,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:55,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:55,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:55,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:21:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:55,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:21:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:55,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:55,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:55,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:21:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:55,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:21:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:55,481 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-12 19:21:55,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:55,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10911001] [2024-10-12 19:21:55,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10911001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:55,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:55,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:21:55,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174107482] [2024-10-12 19:21:55,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:55,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:21:55,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:55,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:21:55,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:21:55,483 INFO L87 Difference]: Start difference. First operand 551 states and 919 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-12 19:21:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:58,896 INFO L93 Difference]: Finished difference Result 1209 states and 2037 transitions. [2024-10-12 19:21:58,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:21:58,897 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-12 19:21:58,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:58,902 INFO L225 Difference]: With dead ends: 1209 [2024-10-12 19:21:58,902 INFO L226 Difference]: Without dead ends: 710 [2024-10-12 19:21:58,904 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-12 19:21:58,905 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 1214 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 2875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 2612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:58,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 1019 Invalid, 2875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 2612 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 19:21:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-10-12 19:21:58,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 551. [2024-10-12 19:21:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 429 states have (on average 1.6946386946386947) internal successors, (727), 450 states have internal predecessors, (727), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-12 19:21:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 914 transitions. [2024-10-12 19:21:58,986 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 914 transitions. Word has length 58 [2024-10-12 19:21:58,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:58,987 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 914 transitions. [2024-10-12 19:21:58,987 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-12 19:21:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 914 transitions. [2024-10-12 19:21:58,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:21:58,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:58,988 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-12 19:21:58,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:21:58,989 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:58,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:58,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1827450385, now seen corresponding path program 1 times [2024-10-12 19:21:58,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:58,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206899084] [2024-10-12 19:21:58,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:58,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:59,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:59,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:59,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:21:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:59,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:21:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:59,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:59,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:59,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:21:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:59,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:21:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:59,724 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-12 19:21:59,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:59,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206899084] [2024-10-12 19:21:59,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206899084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:59,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:59,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-12 19:21:59,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269294477] [2024-10-12 19:21:59,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:59,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 19:21:59,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:59,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 19:21:59,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:21:59,726 INFO L87 Difference]: Start difference. First operand 551 states and 914 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-12 19:22:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:22:07,576 INFO L93 Difference]: Finished difference Result 1237 states and 2084 transitions. [2024-10-12 19:22:07,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-12 19:22:07,577 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-12 19:22:07,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:22:07,582 INFO L225 Difference]: With dead ends: 1237 [2024-10-12 19:22:07,582 INFO L226 Difference]: Without dead ends: 746 [2024-10-12 19:22:07,586 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-12 19:22:07,587 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 854 mSDsluCounter, 2638 mSDsCounter, 0 mSdLazyCounter, 8202 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2942 SdHoareTripleChecker+Invalid, 8332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 8202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:22:07,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2942 Invalid, 8332 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [130 Valid, 8202 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-12 19:22:07,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-10-12 19:22:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 567. [2024-10-12 19:22:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 441 states have (on average 1.6870748299319729) internal successors, (744), 464 states have internal predecessors, (744), 97 states have call successors, (97), 26 states have call predecessors, (97), 28 states have return successors, (96), 90 states have call predecessors, (96), 92 states have call successors, (96) [2024-10-12 19:22:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 937 transitions. [2024-10-12 19:22:07,701 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 937 transitions. Word has length 59 [2024-10-12 19:22:07,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:22:07,701 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 937 transitions. [2024-10-12 19:22:07,702 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-12 19:22:07,702 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 937 transitions. [2024-10-12 19:22:07,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 19:22:07,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:22:07,706 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-12 19:22:07,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:22:07,707 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:22:07,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:22:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1561615390, now seen corresponding path program 1 times [2024-10-12 19:22:07,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:22:07,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402077052] [2024-10-12 19:22:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:22:07,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:22:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:07,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:07,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:07,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:08,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:22:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:08,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:08,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:08,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:22:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:08,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:08,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:22:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:08,217 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-12 19:22:08,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:22:08,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402077052] [2024-10-12 19:22:08,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402077052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:22:08,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:22:08,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:22:08,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971605140] [2024-10-12 19:22:08,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:22:08,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:22:08,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:22:08,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:22:08,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:22:08,219 INFO L87 Difference]: Start difference. First operand 567 states and 937 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-12 19:22:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:22:11,549 INFO L93 Difference]: Finished difference Result 1247 states and 2091 transitions. [2024-10-12 19:22:11,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:22:11,550 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-12 19:22:11,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:22:11,554 INFO L225 Difference]: With dead ends: 1247 [2024-10-12 19:22:11,554 INFO L226 Difference]: Without dead ends: 736 [2024-10-12 19:22:11,556 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-12 19:22:11,557 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1208 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 2856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:22:11,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1040 Invalid, 2856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2601 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 19:22:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-10-12 19:22:11,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 567. [2024-10-12 19:22:11,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 441 states have (on average 1.6757369614512472) internal successors, (739), 464 states have internal predecessors, (739), 97 states have call successors, (97), 26 states have call predecessors, (97), 28 states have return successors, (96), 90 states have call predecessors, (96), 92 states have call successors, (96) [2024-10-12 19:22:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 932 transitions. [2024-10-12 19:22:11,652 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 932 transitions. Word has length 64 [2024-10-12 19:22:11,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:22:11,652 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 932 transitions. [2024-10-12 19:22:11,653 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-12 19:22:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 932 transitions. [2024-10-12 19:22:11,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 19:22:11,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:22:11,655 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-12 19:22:11,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:22:11,655 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:22:11,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:22:11,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1075895168, now seen corresponding path program 1 times [2024-10-12 19:22:11,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:22:11,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921895589] [2024-10-12 19:22:11,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:22:11,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:22:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:11,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:11,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:11,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:22:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:22:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:22:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,169 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-12 19:22:12,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:22:12,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921895589] [2024-10-12 19:22:12,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921895589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:22:12,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:22:12,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:22:12,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12552954] [2024-10-12 19:22:12,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:22:12,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:22:12,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:22:12,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:22:12,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:22:12,171 INFO L87 Difference]: Start difference. First operand 567 states and 932 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-12 19:22:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:22:15,791 INFO L93 Difference]: Finished difference Result 1247 states and 2086 transitions. [2024-10-12 19:22:15,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:22:15,791 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-12 19:22:15,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:22:15,797 INFO L225 Difference]: With dead ends: 1247 [2024-10-12 19:22:15,797 INFO L226 Difference]: Without dead ends: 736 [2024-10-12 19:22:15,799 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-12 19:22:15,800 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 741 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 2724 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:22:15,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 1042 Invalid, 2846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2724 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 19:22:15,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-10-12 19:22:15,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 567. [2024-10-12 19:22:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 441 states have (on average 1.6643990929705215) internal successors, (734), 464 states have internal predecessors, (734), 97 states have call successors, (97), 26 states have call predecessors, (97), 28 states have return successors, (96), 90 states have call predecessors, (96), 92 states have call successors, (96) [2024-10-12 19:22:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 927 transitions. [2024-10-12 19:22:15,917 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 927 transitions. Word has length 65 [2024-10-12 19:22:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:22:15,919 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 927 transitions. [2024-10-12 19:22:15,919 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-12 19:22:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 927 transitions. [2024-10-12 19:22:15,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 19:22:15,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:22:15,923 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-12 19:22:15,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:22:15,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:22:15,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:22:15,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1320576039, now seen corresponding path program 1 times [2024-10-12 19:22:15,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:22:15,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494986936] [2024-10-12 19:22:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:22:15,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:22:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:22:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:22:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:22:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,450 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-12 19:22:16,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:22:16,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494986936] [2024-10-12 19:22:16,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494986936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:22:16,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:22:16,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:22:16,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271112444] [2024-10-12 19:22:16,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:22:16,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:22:16,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:22:16,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:22:16,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:22:16,453 INFO L87 Difference]: Start difference. First operand 567 states and 927 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-12 19:22:19,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:22:19,937 INFO L93 Difference]: Finished difference Result 1247 states and 2081 transitions. [2024-10-12 19:22:19,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:22:19,938 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-12 19:22:19,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:22:19,941 INFO L225 Difference]: With dead ends: 1247 [2024-10-12 19:22:19,941 INFO L226 Difference]: Without dead ends: 736 [2024-10-12 19:22:19,943 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-12 19:22:19,944 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 1213 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 2548 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 2813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:22:19,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 998 Invalid, 2813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2548 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 19:22:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-10-12 19:22:20,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 567. [2024-10-12 19:22:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 441 states have (on average 1.653061224489796) internal successors, (729), 464 states have internal predecessors, (729), 97 states have call successors, (97), 26 states have call predecessors, (97), 28 states have return successors, (96), 90 states have call predecessors, (96), 92 states have call successors, (96) [2024-10-12 19:22:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 922 transitions. [2024-10-12 19:22:20,039 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 922 transitions. Word has length 66 [2024-10-12 19:22:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:22:20,039 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 922 transitions. [2024-10-12 19:22:20,039 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-12 19:22:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 922 transitions. [2024-10-12 19:22:20,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 19:22:20,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:22:20,041 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-12 19:22:20,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:22:20,042 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:22:20,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:22:20,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1658819960, now seen corresponding path program 1 times [2024-10-12 19:22:20,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:22:20,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977631199] [2024-10-12 19:22:20,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:22:20,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:22:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:20,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:20,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:20,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:20,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:22:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:20,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:20,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:20,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:22:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:20,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:20,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:22:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:20,589 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-12 19:22:20,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:22:20,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977631199] [2024-10-12 19:22:20,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977631199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:22:20,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:22:20,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:22:20,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108924132] [2024-10-12 19:22:20,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:22:20,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:22:20,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:22:20,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:22:20,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:22:20,593 INFO L87 Difference]: Start difference. First operand 567 states and 922 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-12 19:22:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:22:25,858 INFO L93 Difference]: Finished difference Result 1233 states and 2049 transitions. [2024-10-12 19:22:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:22:25,858 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2024-10-12 19:22:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:22:25,862 INFO L225 Difference]: With dead ends: 1233 [2024-10-12 19:22:25,862 INFO L226 Difference]: Without dead ends: 734 [2024-10-12 19:22:25,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:22:25,864 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 728 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 4927 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 5047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 4927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:22:25,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1832 Invalid, 5047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 4927 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-12 19:22:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-10-12 19:22:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 569. [2024-10-12 19:22:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 443 states have (on average 1.6478555304740405) internal successors, (730), 466 states have internal predecessors, (730), 97 states have call successors, (97), 26 states have call predecessors, (97), 28 states have return successors, (96), 90 states have call predecessors, (96), 92 states have call successors, (96) [2024-10-12 19:22:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 923 transitions. [2024-10-12 19:22:25,959 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 923 transitions. Word has length 66 [2024-10-12 19:22:25,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:22:25,959 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 923 transitions. [2024-10-12 19:22:25,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-12 19:22:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 923 transitions. [2024-10-12 19:22:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 19:22:25,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:22:25,961 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] [2024-10-12 19:22:25,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:22:25,961 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:22:25,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:22:25,961 INFO L85 PathProgramCache]: Analyzing trace with hash 401980645, now seen corresponding path program 1 times [2024-10-12 19:22:25,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:22:25,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532471038] [2024-10-12 19:22:25,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:22:25,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:22:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:26,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:26,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:26,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:26,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:22:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:26,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:26,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:26,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:22:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:26,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:26,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:22:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:26,425 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-12 19:22:26,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:22:26,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532471038] [2024-10-12 19:22:26,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532471038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:22:26,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:22:26,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:22:26,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704569525] [2024-10-12 19:22:26,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:22:26,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:22:26,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:22:26,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:22:26,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:22:26,428 INFO L87 Difference]: Start difference. First operand 569 states and 923 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-12 19:22:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:22:29,782 INFO L93 Difference]: Finished difference Result 1253 states and 2078 transitions. [2024-10-12 19:22:29,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:22:29,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 67 [2024-10-12 19:22:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:22:29,788 INFO L225 Difference]: With dead ends: 1253 [2024-10-12 19:22:29,788 INFO L226 Difference]: Without dead ends: 740 [2024-10-12 19:22:29,790 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-12 19:22:29,790 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1204 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:22:29,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 1029 Invalid, 2795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 19:22:29,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2024-10-12 19:22:29,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 569. [2024-10-12 19:22:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 443 states have (on average 1.636568848758465) internal successors, (725), 466 states have internal predecessors, (725), 97 states have call successors, (97), 26 states have call predecessors, (97), 28 states have return successors, (96), 90 states have call predecessors, (96), 92 states have call successors, (96) [2024-10-12 19:22:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 918 transitions. [2024-10-12 19:22:29,875 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 918 transitions. Word has length 67 [2024-10-12 19:22:29,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:22:29,876 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 918 transitions. [2024-10-12 19:22:29,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-12 19:22:29,876 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 918 transitions. [2024-10-12 19:22:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 19:22:29,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:22:29,878 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] [2024-10-12 19:22:29,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:22:29,878 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:22:29,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:22:29,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1497815390, now seen corresponding path program 1 times [2024-10-12 19:22:29,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:22:29,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542420904] [2024-10-12 19:22:29,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:22:29,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:22:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:30,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:30,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:30,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:30,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:22:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:30,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:30,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:30,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:22:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:30,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:30,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:22:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:30,403 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-12 19:22:30,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:22:30,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542420904] [2024-10-12 19:22:30,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542420904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:22:30,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:22:30,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:22:30,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309626363] [2024-10-12 19:22:30,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:22:30,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:22:30,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:22:30,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:22:30,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:22:30,405 INFO L87 Difference]: Start difference. First operand 569 states and 918 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-12 19:22:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:22:33,850 INFO L93 Difference]: Finished difference Result 1227 states and 2033 transitions. [2024-10-12 19:22:33,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:22:33,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2024-10-12 19:22:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:22:33,854 INFO L225 Difference]: With dead ends: 1227 [2024-10-12 19:22:33,854 INFO L226 Difference]: Without dead ends: 730 [2024-10-12 19:22:33,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:22:33,857 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 1191 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 2509 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 2774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:22:33,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 967 Invalid, 2774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2509 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 19:22:33,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-10-12 19:22:33,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 569. [2024-10-12 19:22:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 443 states have (on average 1.6343115124153498) internal successors, (724), 466 states have internal predecessors, (724), 97 states have call successors, (97), 26 states have call predecessors, (97), 28 states have return successors, (96), 90 states have call predecessors, (96), 92 states have call successors, (96) [2024-10-12 19:22:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 917 transitions. [2024-10-12 19:22:33,941 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 917 transitions. Word has length 67 [2024-10-12 19:22:33,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:22:33,941 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 917 transitions. [2024-10-12 19:22:33,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-12 19:22:33,942 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 917 transitions. [2024-10-12 19:22:33,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 19:22:33,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:22:33,943 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-12 19:22:33,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:22:33,944 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:22:33,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:22:33,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2076526700, now seen corresponding path program 1 times [2024-10-12 19:22:33,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:22:33,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373051523] [2024-10-12 19:22:33,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:22:33,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:22:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:34,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:34,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:34,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:34,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:22:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:34,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:34,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:34,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:22:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:34,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:34,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:22:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:34,451 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-12 19:22:34,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:22:34,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373051523] [2024-10-12 19:22:34,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373051523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:22:34,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:22:34,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:22:34,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001230483] [2024-10-12 19:22:34,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:22:34,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:22:34,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:22:34,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:22:34,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:22:34,453 INFO L87 Difference]: Start difference. First operand 569 states and 917 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 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-12 19:22:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:22:37,951 INFO L93 Difference]: Finished difference Result 1279 states and 2097 transitions. [2024-10-12 19:22:37,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:22:37,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 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 68 [2024-10-12 19:22:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:22:37,956 INFO L225 Difference]: With dead ends: 1279 [2024-10-12 19:22:37,957 INFO L226 Difference]: Without dead ends: 679 [2024-10-12 19:22:37,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:22:37,959 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 1146 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 2799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:22:37,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 986 Invalid, 2799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 19:22:37,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-10-12 19:22:38,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 528. [2024-10-12 19:22:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 405 states have (on average 1.6592592592592592) internal successors, (672), 426 states have internal predecessors, (672), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2024-10-12 19:22:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 861 transitions. [2024-10-12 19:22:38,073 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 861 transitions. Word has length 68 [2024-10-12 19:22:38,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:22:38,073 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 861 transitions. [2024-10-12 19:22:38,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 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-12 19:22:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 861 transitions. [2024-10-12 19:22:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 19:22:38,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:22:38,076 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:22:38,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:22:38,076 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:22:38,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:22:38,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1391323679, now seen corresponding path program 1 times [2024-10-12 19:22:38,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:22:38,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284964990] [2024-10-12 19:22:38,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:22:38,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:22:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:38,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:38,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:38,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:38,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:22:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:38,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:38,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:38,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:22:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:38,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:22:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:38,759 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-12 19:22:38,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:22:38,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284964990] [2024-10-12 19:22:38,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284964990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:22:38,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:22:38,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 19:22:38,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823336492] [2024-10-12 19:22:38,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:22:38,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 19:22:38,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:22:38,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 19:22:38,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:22:38,761 INFO L87 Difference]: Start difference. First operand 528 states and 861 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9)