./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product31.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/product-lines/elevator_spec9_product31.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 21dc9f7e2ddd4ffb05ac36477bf46e7266bc68ad137742c8de338dbab6571869 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:34:41,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:34:41,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:34:41,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:34:41,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:34:41,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:34:41,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:34:41,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:34:41,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:34:41,598 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:34:41,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:34:41,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:34:41,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:34:41,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:34:41,600 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:34:41,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:34:41,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:34:41,603 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:34:41,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:34:41,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:34:41,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:34:41,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:34:41,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:34:41,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:34:41,608 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:34:41,608 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:34:41,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:34:41,609 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:34:41,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:34:41,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:34:41,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:34:41,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:34:41,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:34:41,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:34:41,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:34:41,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:34:41,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:34:41,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:34:41,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:34:41,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:34:41,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:34:41,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:34:41,612 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 -> 21dc9f7e2ddd4ffb05ac36477bf46e7266bc68ad137742c8de338dbab6571869 [2024-11-11 20:34:41,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:34:41,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:34:41,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:34:41,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:34:41,849 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:34:41,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product31.cil.c [2024-11-11 20:34:43,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:34:43,490 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:34:43,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product31.cil.c [2024-11-11 20:34:43,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa4026da/e78c2fef845c4320a8a12228fc1a07f9/FLAGb31f8e8ff [2024-11-11 20:34:43,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa4026da/e78c2fef845c4320a8a12228fc1a07f9 [2024-11-11 20:34:43,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:34:43,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:34:43,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:34:43,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:34:43,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:34:43,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:34:43" (1/1) ... [2024-11-11 20:34:43,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1540ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:43, skipping insertion in model container [2024-11-11 20:34:43,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:34:43" (1/1) ... [2024-11-11 20:34:43,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:34:44,087 WARN L250 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_product31.cil.c[5910,5923] [2024-11-11 20:34:44,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:34:44,370 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:34:44,378 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [48] [2024-11-11 20:34:44,379 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [169] [2024-11-11 20:34:44,379 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [183] [2024-11-11 20:34:44,379 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [284] [2024-11-11 20:34:44,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [293] [2024-11-11 20:34:44,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [960] [2024-11-11 20:34:44,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1122] [2024-11-11 20:34:44,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2737] [2024-11-11 20:34:44,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2775] [2024-11-11 20:34:44,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3141] [2024-11-11 20:34:44,389 WARN L250 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_product31.cil.c[5910,5923] [2024-11-11 20:34:44,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:34:44,502 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:34:44,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:44 WrapperNode [2024-11-11 20:34:44,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:34:44,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:34:44,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:34:44,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:34:44,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:44" (1/1) ... [2024-11-11 20:34:44,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:44" (1/1) ... [2024-11-11 20:34:44,589 INFO L138 Inliner]: procedures = 97, calls = 346, calls flagged for inlining = 28, calls inlined = 25, statements flattened = 924 [2024-11-11 20:34:44,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:34:44,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:34:44,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:34:44,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:34:44,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:44" (1/1) ... [2024-11-11 20:34:44,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:44" (1/1) ... [2024-11-11 20:34:44,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:44" (1/1) ... [2024-11-11 20:34:44,640 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-11-11 20:34:44,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:44" (1/1) ... [2024-11-11 20:34:44,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:44" (1/1) ... [2024-11-11 20:34:44,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:44" (1/1) ... [2024-11-11 20:34:44,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:44" (1/1) ... [2024-11-11 20:34:44,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:44" (1/1) ... [2024-11-11 20:34:44,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:44" (1/1) ... [2024-11-11 20:34:44,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:34:44,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:34:44,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:34:44,682 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:34:44,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:44" (1/1) ... [2024-11-11 20:34:44,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:34:44,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:34:44,719 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-11-11 20:34:44,728 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-11-11 20:34:44,790 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-11 20:34:44,791 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-11 20:34:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-11 20:34:44,791 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-11 20:34:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-11 20:34:44,791 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-11 20:34:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-11-11 20:34:44,791 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-11-11 20:34:44,792 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:34:44,792 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:34:44,792 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-11 20:34:44,792 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-11 20:34:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-11 20:34:44,793 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-11 20:34:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-11-11 20:34:44,793 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-11-11 20:34:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-11-11 20:34:44,793 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-11-11 20:34:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-11 20:34:44,795 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-11 20:34:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-11 20:34:44,796 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-11 20:34:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:34:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-11-11 20:34:44,796 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-11-11 20:34:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-11 20:34:44,797 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-11 20:34:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-11-11 20:34:44,797 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-11-11 20:34:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-11 20:34:44,797 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-11 20:34:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:34:44,797 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:34:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-11 20:34:44,797 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-11 20:34:44,797 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-11 20:34:44,798 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-11 20:34:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-11 20:34:44,798 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-11 20:34:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-11 20:34:44,798 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-11 20:34:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-11 20:34:44,798 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-11 20:34:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-11 20:34:44,798 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-11 20:34:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-11 20:34:44,798 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-11 20:34:44,799 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-11-11 20:34:44,799 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-11-11 20:34:44,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:34:44,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:34:44,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:34:44,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:34:44,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-11 20:34:44,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-11 20:34:44,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-11 20:34:44,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-11 20:34:44,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-11 20:34:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-11 20:34:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-11 20:34:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-11 20:34:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-11 20:34:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-11 20:34:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-11 20:34:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-11 20:34:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-11 20:34:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-11 20:34:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-11 20:34:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-11 20:34:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-11 20:34:44,801 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-11 20:34:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:34:44,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:34:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-11 20:34:44,802 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-11 20:34:44,989 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:34:44,992 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:34:45,975 INFO L? ?]: Removed 477 outVars from TransFormulas that were not future-live. [2024-11-11 20:34:45,976 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:34:45,996 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:34:45,996 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:34:45,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:34:45 BoogieIcfgContainer [2024-11-11 20:34:45,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:34:45,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:34:45,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:34:46,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:34:46,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:34:43" (1/3) ... [2024-11-11 20:34:46,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8e24d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:34:46, skipping insertion in model container [2024-11-11 20:34:46,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:44" (2/3) ... [2024-11-11 20:34:46,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8e24d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:34:46, skipping insertion in model container [2024-11-11 20:34:46,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:34:45" (3/3) ... [2024-11-11 20:34:46,003 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product31.cil.c [2024-11-11 20:34:46,015 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:34:46,015 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:34:46,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:34:46,090 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;@71c1f66b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:34:46,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:34:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 587 states, 460 states have (on average 1.682608695652174) internal successors, (774), 481 states have internal predecessors, (774), 99 states have call successors, (99), 26 states have call predecessors, (99), 26 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-11 20:34:46,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-11 20:34:46,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:46,127 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:46,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:46,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:46,133 INFO L85 PathProgramCache]: Analyzing trace with hash 450011275, now seen corresponding path program 1 times [2024-11-11 20:34:46,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:46,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312783938] [2024-11-11 20:34:46,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:46,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:46,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:46,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:46,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:34:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 20:34:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:34:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:34:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:34:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:34:47,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:47,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312783938] [2024-11-11 20:34:47,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312783938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:47,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:47,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:34:47,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784934924] [2024-11-11 20:34:47,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:47,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:34:47,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:47,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:34:47,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:47,261 INFO L87 Difference]: Start difference. First operand has 587 states, 460 states have (on average 1.682608695652174) internal successors, (774), 481 states have internal predecessors, (774), 99 states have call successors, (99), 26 states have call predecessors, (99), 26 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:34:52,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:52,205 INFO L93 Difference]: Finished difference Result 1395 states and 2347 transitions. [2024-11-11 20:34:52,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:34:52,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 106 [2024-11-11 20:34:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:52,228 INFO L225 Difference]: With dead ends: 1395 [2024-11-11 20:34:52,228 INFO L226 Difference]: Without dead ends: 820 [2024-11-11 20:34:52,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:52,239 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 1003 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 3254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:52,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 1748 Invalid, 3254 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [206 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-11 20:34:52,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2024-11-11 20:34:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 579. [2024-11-11 20:34:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 454 states have (on average 1.6784140969162995) internal successors, (762), 473 states have internal predecessors, (762), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-11 20:34:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 955 transitions. [2024-11-11 20:34:52,452 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 955 transitions. Word has length 106 [2024-11-11 20:34:52,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:52,452 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 955 transitions. [2024-11-11 20:34:52,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:34:52,453 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 955 transitions. [2024-11-11 20:34:52,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 20:34:52,460 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:52,460 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:52,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:34:52,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:52,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:52,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1974609341, now seen corresponding path program 1 times [2024-11-11 20:34:52,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:52,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516105013] [2024-11-11 20:34:52,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:52,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:34:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:34:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:34:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:34:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:34:53,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516105013] [2024-11-11 20:34:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516105013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:53,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:53,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:34:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584824995] [2024-11-11 20:34:53,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:53,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:34:53,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:53,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:34:53,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:53,110 INFO L87 Difference]: Start difference. First operand 579 states and 955 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:34:57,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:57,266 INFO L93 Difference]: Finished difference Result 1381 states and 2309 transitions. [2024-11-11 20:34:57,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:34:57,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2024-11-11 20:34:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:57,272 INFO L225 Difference]: With dead ends: 1381 [2024-11-11 20:34:57,272 INFO L226 Difference]: Without dead ends: 820 [2024-11-11 20:34:57,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:57,275 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 1948 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 2849 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2027 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 3355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 2849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:57,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2027 Valid, 1611 Invalid, 3355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [506 Valid, 2849 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-11 20:34:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2024-11-11 20:34:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 579. [2024-11-11 20:34:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 454 states have (on average 1.6762114537444934) internal successors, (761), 473 states have internal predecessors, (761), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-11 20:34:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 954 transitions. [2024-11-11 20:34:57,366 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 954 transitions. Word has length 109 [2024-11-11 20:34:57,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:57,366 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 954 transitions. [2024-11-11 20:34:57,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:34:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 954 transitions. [2024-11-11 20:34:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 20:34:57,373 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:57,373 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:57,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:34:57,374 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:57,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:57,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1927851990, now seen corresponding path program 1 times [2024-11-11 20:34:57,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:57,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893803769] [2024-11-11 20:34:57,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:57,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:34:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:34:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:34:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:34:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:34:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:34:57,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:57,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893803769] [2024-11-11 20:34:57,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893803769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:57,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:57,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:34:57,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527155059] [2024-11-11 20:34:57,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:57,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:34:57,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:57,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:34:57,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:57,863 INFO L87 Difference]: Start difference. First operand 579 states and 954 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:02,022 INFO L93 Difference]: Finished difference Result 1381 states and 2308 transitions. [2024-11-11 20:35:02,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:35:02,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2024-11-11 20:35:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:02,031 INFO L225 Difference]: With dead ends: 1381 [2024-11-11 20:35:02,032 INFO L226 Difference]: Without dead ends: 820 [2024-11-11 20:35:02,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:35:02,035 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 1952 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 2829 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2031 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 3349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 2829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:02,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2031 Valid, 1594 Invalid, 3349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [520 Valid, 2829 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-11 20:35:02,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2024-11-11 20:35:02,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 579. [2024-11-11 20:35:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 454 states have (on average 1.6740088105726871) internal successors, (760), 473 states have internal predecessors, (760), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-11 20:35:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 953 transitions. [2024-11-11 20:35:02,127 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 953 transitions. Word has length 110 [2024-11-11 20:35:02,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:02,127 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 953 transitions. [2024-11-11 20:35:02,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:02,127 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 953 transitions. [2024-11-11 20:35:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:35:02,131 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:02,132 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:02,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:35:02,132 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:02,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:02,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1635088295, now seen corresponding path program 1 times [2024-11-11 20:35:02,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:02,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479621461] [2024-11-11 20:35:02,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:02,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:35:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:35:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:35:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:35:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:35:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:35:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:35:02,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:02,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479621461] [2024-11-11 20:35:02,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479621461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:02,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:02,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:35:02,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639329889] [2024-11-11 20:35:02,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:02,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:35:02,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:02,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:35:02,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:35:02,961 INFO L87 Difference]: Start difference. First operand 579 states and 953 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:07,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:07,134 INFO L93 Difference]: Finished difference Result 1381 states and 2307 transitions. [2024-11-11 20:35:07,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:35:07,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-11-11 20:35:07,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:07,139 INFO L225 Difference]: With dead ends: 1381 [2024-11-11 20:35:07,140 INFO L226 Difference]: Without dead ends: 820 [2024-11-11 20:35:07,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:35:07,142 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 1474 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 2885 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 3238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 2885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:07,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 1668 Invalid, 3238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 2885 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-11 20:35:07,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2024-11-11 20:35:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 579. [2024-11-11 20:35:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 454 states have (on average 1.671806167400881) internal successors, (759), 473 states have internal predecessors, (759), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-11 20:35:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 952 transitions. [2024-11-11 20:35:07,263 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 952 transitions. Word has length 111 [2024-11-11 20:35:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:07,264 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 952 transitions. [2024-11-11 20:35:07,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:07,264 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 952 transitions. [2024-11-11 20:35:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 20:35:07,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:07,266 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:07,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:35:07,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:07,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:07,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1764417458, now seen corresponding path program 1 times [2024-11-11 20:35:07,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:07,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8464483] [2024-11-11 20:35:07,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:07,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:07,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:07,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:07,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:35:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:07,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:35:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:07,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:07,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:07,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:07,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:07,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:35:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:07,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:07,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:07,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:07,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:35:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:07,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:35:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:07,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:35:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:35:07,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:07,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8464483] [2024-11-11 20:35:07,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8464483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:07,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:07,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:35:07,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444358198] [2024-11-11 20:35:07,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:07,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:35:07,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:07,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:35:07,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:35:07,950 INFO L87 Difference]: Start difference. First operand 579 states and 952 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:12,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:12,018 INFO L93 Difference]: Finished difference Result 1381 states and 2306 transitions. [2024-11-11 20:35:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:35:12,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2024-11-11 20:35:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:12,023 INFO L225 Difference]: With dead ends: 1381 [2024-11-11 20:35:12,023 INFO L226 Difference]: Without dead ends: 820 [2024-11-11 20:35:12,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:35:12,028 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 1950 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 2828 mSolverCounterSat, 524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2029 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 3352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 524 IncrementalHoareTripleChecker+Valid, 2828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:12,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2029 Valid, 1583 Invalid, 3352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [524 Valid, 2828 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-11 20:35:12,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2024-11-11 20:35:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 579. [2024-11-11 20:35:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 454 states have (on average 1.669603524229075) internal successors, (758), 473 states have internal predecessors, (758), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-11 20:35:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 951 transitions. [2024-11-11 20:35:12,121 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 951 transitions. Word has length 112 [2024-11-11 20:35:12,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:12,122 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 951 transitions. [2024-11-11 20:35:12,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:12,122 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 951 transitions. [2024-11-11 20:35:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 20:35:12,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:12,126 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:12,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:35:12,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:12,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:12,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1956418293, now seen corresponding path program 1 times [2024-11-11 20:35:12,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:12,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460053004] [2024-11-11 20:35:12,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:12,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:12,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:12,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:12,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:12,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:35:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:12,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:12,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:12,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:12,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:12,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:35:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:12,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:12,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:12,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:12,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:35:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:12,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:35:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:12,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:35:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:12,729 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:35:12,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:12,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460053004] [2024-11-11 20:35:12,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460053004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:12,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:12,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:35:12,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179995086] [2024-11-11 20:35:12,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:12,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:35:12,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:12,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:35:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:35:12,731 INFO L87 Difference]: Start difference. First operand 579 states and 951 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:35:18,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:18,765 INFO L93 Difference]: Finished difference Result 1358 states and 2256 transitions. [2024-11-11 20:35:18,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 20:35:18,769 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2024-11-11 20:35:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:18,776 INFO L225 Difference]: With dead ends: 1358 [2024-11-11 20:35:18,776 INFO L226 Difference]: Without dead ends: 846 [2024-11-11 20:35:18,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:35:18,780 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 1574 mSDsluCounter, 3381 mSDsCounter, 0 mSdLazyCounter, 7145 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 3828 SdHoareTripleChecker+Invalid, 7500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 7145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:18,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 3828 Invalid, 7500 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [355 Valid, 7145 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-11 20:35:18,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2024-11-11 20:35:18,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 592. [2024-11-11 20:35:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 464 states have (on average 1.665948275862069) internal successors, (773), 485 states have internal predecessors, (773), 100 states have call successors, (100), 26 states have call predecessors, (100), 27 states have return successors, (97), 93 states have call predecessors, (97), 95 states have call successors, (97) [2024-11-11 20:35:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 970 transitions. [2024-11-11 20:35:18,924 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 970 transitions. Word has length 113 [2024-11-11 20:35:18,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:18,924 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 970 transitions. [2024-11-11 20:35:18,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:35:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 970 transitions. [2024-11-11 20:35:18,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 20:35:18,928 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:18,928 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:18,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:35:18,929 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:18,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:18,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1428052692, now seen corresponding path program 1 times [2024-11-11 20:35:18,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:18,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5777967] [2024-11-11 20:35:18,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:18,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:35:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:35:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:35:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:35:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:35:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:35:19,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:19,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5777967] [2024-11-11 20:35:19,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5777967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:19,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:19,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:35:19,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831402784] [2024-11-11 20:35:19,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:19,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:35:19,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:19,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:35:19,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:35:19,368 INFO L87 Difference]: Start difference. First operand 592 states and 970 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:23,158 INFO L93 Difference]: Finished difference Result 1384 states and 2298 transitions. [2024-11-11 20:35:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:35:23,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2024-11-11 20:35:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:23,163 INFO L225 Difference]: With dead ends: 1384 [2024-11-11 20:35:23,167 INFO L226 Difference]: Without dead ends: 854 [2024-11-11 20:35:23,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:35:23,170 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 1553 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 2861 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 3224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 2861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:23,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1632 Valid, 1648 Invalid, 3224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 2861 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-11 20:35:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-11-11 20:35:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 592. [2024-11-11 20:35:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 464 states have (on average 1.6551724137931034) internal successors, (768), 485 states have internal predecessors, (768), 100 states have call successors, (100), 26 states have call predecessors, (100), 27 states have return successors, (97), 93 states have call predecessors, (97), 95 states have call successors, (97) [2024-11-11 20:35:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 965 transitions. [2024-11-11 20:35:23,265 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 965 transitions. Word has length 113 [2024-11-11 20:35:23,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:23,266 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 965 transitions. [2024-11-11 20:35:23,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 965 transitions. [2024-11-11 20:35:23,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 20:35:23,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:23,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:23,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:35:23,268 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:23,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:23,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1291655689, now seen corresponding path program 1 times [2024-11-11 20:35:23,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:23,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772254863] [2024-11-11 20:35:23,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:23,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:23,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:23,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:23,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:23,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:35:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:23,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:23,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:23,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:23,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:23,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:35:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:23,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:23,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:23,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:23,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:35:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:23,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:35:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:23,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:35:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:35:23,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:23,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772254863] [2024-11-11 20:35:23,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772254863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:23,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:23,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:35:23,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647679180] [2024-11-11 20:35:23,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:23,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:35:23,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:23,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:35:23,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:35:23,740 INFO L87 Difference]: Start difference. First operand 592 states and 965 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:27,415 INFO L93 Difference]: Finished difference Result 1384 states and 2293 transitions. [2024-11-11 20:35:27,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:35:27,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-11-11 20:35:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:27,420 INFO L225 Difference]: With dead ends: 1384 [2024-11-11 20:35:27,420 INFO L226 Difference]: Without dead ends: 854 [2024-11-11 20:35:27,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:35:27,422 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 1533 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 2940 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1612 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 3305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 2940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:27,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1612 Valid, 1652 Invalid, 3305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 2940 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-11 20:35:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-11-11 20:35:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 592. [2024-11-11 20:35:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 464 states have (on average 1.644396551724138) internal successors, (763), 485 states have internal predecessors, (763), 100 states have call successors, (100), 26 states have call predecessors, (100), 27 states have return successors, (97), 93 states have call predecessors, (97), 95 states have call successors, (97) [2024-11-11 20:35:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 960 transitions. [2024-11-11 20:35:27,514 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 960 transitions. Word has length 114 [2024-11-11 20:35:27,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:27,515 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 960 transitions. [2024-11-11 20:35:27,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:27,515 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 960 transitions. [2024-11-11 20:35:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-11 20:35:27,518 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:27,518 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:27,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:35:27,518 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:27,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1630103495, now seen corresponding path program 1 times [2024-11-11 20:35:27,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:27,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432545821] [2024-11-11 20:35:27,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:27,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:27,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:27,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:27,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:35:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:35:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:35:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:35:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:35:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:35:28,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:28,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432545821] [2024-11-11 20:35:28,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432545821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:28,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:28,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:35:28,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911183285] [2024-11-11 20:35:28,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:28,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:35:28,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:28,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:35:28,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:35:28,092 INFO L87 Difference]: Start difference. First operand 592 states and 960 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:31,900 INFO L93 Difference]: Finished difference Result 1384 states and 2288 transitions. [2024-11-11 20:35:31,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:35:31,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2024-11-11 20:35:31,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:31,905 INFO L225 Difference]: With dead ends: 1384 [2024-11-11 20:35:31,905 INFO L226 Difference]: Without dead ends: 854 [2024-11-11 20:35:31,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:35:31,907 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 2029 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 2736 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2108 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 3269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 2736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:31,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2108 Valid, 1586 Invalid, 3269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 2736 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-11 20:35:31,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-11-11 20:35:31,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 592. [2024-11-11 20:35:31,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 464 states have (on average 1.6336206896551724) internal successors, (758), 485 states have internal predecessors, (758), 100 states have call successors, (100), 26 states have call predecessors, (100), 27 states have return successors, (97), 93 states have call predecessors, (97), 95 states have call successors, (97) [2024-11-11 20:35:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 955 transitions. [2024-11-11 20:35:31,999 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 955 transitions. Word has length 115 [2024-11-11 20:35:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:31,999 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 955 transitions. [2024-11-11 20:35:31,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 955 transitions. [2024-11-11 20:35:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 20:35:32,002 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:32,002 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:32,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:35:32,002 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:32,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:32,003 INFO L85 PathProgramCache]: Analyzing trace with hash -825718692, now seen corresponding path program 1 times [2024-11-11 20:35:32,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:32,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050656168] [2024-11-11 20:35:32,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:32,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:35:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:35:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:35:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:35:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:35:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,493 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:35:32,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:32,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050656168] [2024-11-11 20:35:32,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050656168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:32,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:32,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:35:32,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408965319] [2024-11-11 20:35:32,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:32,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:35:32,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:32,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:35:32,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:35:32,495 INFO L87 Difference]: Start difference. First operand 592 states and 955 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:36,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:36,407 INFO L93 Difference]: Finished difference Result 1357 states and 2239 transitions. [2024-11-11 20:35:36,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:35:36,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-11 20:35:36,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:36,429 INFO L225 Difference]: With dead ends: 1357 [2024-11-11 20:35:36,429 INFO L226 Difference]: Without dead ends: 842 [2024-11-11 20:35:36,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:35:36,435 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 1508 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 2735 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 3096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 2735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:36,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1587 Valid, 1648 Invalid, 3096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 2735 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-11 20:35:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2024-11-11 20:35:36,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 592. [2024-11-11 20:35:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 464 states have (on average 1.6314655172413792) internal successors, (757), 485 states have internal predecessors, (757), 100 states have call successors, (100), 26 states have call predecessors, (100), 27 states have return successors, (97), 93 states have call predecessors, (97), 95 states have call successors, (97) [2024-11-11 20:35:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 954 transitions. [2024-11-11 20:35:36,529 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 954 transitions. Word has length 116 [2024-11-11 20:35:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:36,530 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 954 transitions. [2024-11-11 20:35:36,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 954 transitions. [2024-11-11 20:35:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 20:35:36,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:36,532 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:36,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:35:36,533 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:36,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:36,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1163917508, now seen corresponding path program 1 times [2024-11-11 20:35:36,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:36,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557900800] [2024-11-11 20:35:36,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:36,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:36,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:36,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:36,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:37,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:35:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:37,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:37,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:37,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:37,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:37,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:35:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:37,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:37,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:37,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:37,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:35:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:37,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:35:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:37,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:35:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:37,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:35:37,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:37,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557900800] [2024-11-11 20:35:37,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557900800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:37,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:37,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:35:37,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344718032] [2024-11-11 20:35:37,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:37,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:35:37,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:37,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:35:37,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:35:37,160 INFO L87 Difference]: Start difference. First operand 592 states and 954 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:40,810 INFO L93 Difference]: Finished difference Result 1384 states and 2279 transitions. [2024-11-11 20:35:40,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:35:40,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-11 20:35:40,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:40,815 INFO L225 Difference]: With dead ends: 1384 [2024-11-11 20:35:40,815 INFO L226 Difference]: Without dead ends: 854 [2024-11-11 20:35:40,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:35:40,817 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 1054 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 2952 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 3159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 2952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:40,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 1718 Invalid, 3159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 2952 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-11 20:35:40,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-11-11 20:35:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 592. [2024-11-11 20:35:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 464 states have (on average 1.6206896551724137) internal successors, (752), 485 states have internal predecessors, (752), 100 states have call successors, (100), 26 states have call predecessors, (100), 27 states have return successors, (97), 93 states have call predecessors, (97), 95 states have call successors, (97) [2024-11-11 20:35:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 949 transitions. [2024-11-11 20:35:40,945 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 949 transitions. Word has length 116 [2024-11-11 20:35:40,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:40,946 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 949 transitions. [2024-11-11 20:35:40,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 949 transitions. [2024-11-11 20:35:40,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 20:35:40,948 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:40,948 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:40,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:35:40,948 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:40,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:40,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1151855748, now seen corresponding path program 1 times [2024-11-11 20:35:40,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:40,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238272897] [2024-11-11 20:35:40,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:40,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:41,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:41,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:41,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:41,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:35:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:41,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:41,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:41,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:41,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:41,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:35:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:41,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:41,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:41,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:41,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:35:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:41,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:35:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:41,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:35:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:35:41,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:41,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238272897] [2024-11-11 20:35:41,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238272897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:41,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:41,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:35:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346804250] [2024-11-11 20:35:41,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:41,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:35:41,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:41,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:35:41,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:35:41,431 INFO L87 Difference]: Start difference. First operand 592 states and 949 transitions. Second operand has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:35:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:46,914 INFO L93 Difference]: Finished difference Result 1370 states and 2247 transitions. [2024-11-11 20:35:46,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:35:46,915 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2024-11-11 20:35:46,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:46,919 INFO L225 Difference]: With dead ends: 1370 [2024-11-11 20:35:46,919 INFO L226 Difference]: Without dead ends: 852 [2024-11-11 20:35:46,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:35:46,921 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 1023 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 5350 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 3039 SdHoareTripleChecker+Invalid, 5554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 5350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:46,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 3039 Invalid, 5554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 5350 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-11 20:35:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-11-11 20:35:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 595. [2024-11-11 20:35:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 467 states have (on average 1.614561027837259) internal successors, (754), 488 states have internal predecessors, (754), 100 states have call successors, (100), 26 states have call predecessors, (100), 27 states have return successors, (97), 93 states have call predecessors, (97), 95 states have call successors, (97) [2024-11-11 20:35:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 951 transitions. [2024-11-11 20:35:47,019 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 951 transitions. Word has length 117 [2024-11-11 20:35:47,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:47,019 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 951 transitions. [2024-11-11 20:35:47,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:35:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 951 transitions. [2024-11-11 20:35:47,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 20:35:47,021 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:47,021 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:47,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:35:47,021 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:47,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:47,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1523887714, now seen corresponding path program 1 times [2024-11-11 20:35:47,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:47,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950727536] [2024-11-11 20:35:47,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:47,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:47,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:47,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:47,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:47,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:35:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:47,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:47,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:47,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:47,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:47,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:35:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:47,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:47,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:47,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:47,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:35:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:35:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:47,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:35:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:35:47,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:47,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950727536] [2024-11-11 20:35:47,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950727536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:47,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:47,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:35:47,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263339458] [2024-11-11 20:35:47,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:47,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:35:47,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:47,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:35:47,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:35:47,426 INFO L87 Difference]: Start difference. First operand 595 states and 951 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:51,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:51,262 INFO L93 Difference]: Finished difference Result 1393 states and 2279 transitions. [2024-11-11 20:35:51,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:35:51,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-11-11 20:35:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:51,267 INFO L225 Difference]: With dead ends: 1393 [2024-11-11 20:35:51,267 INFO L226 Difference]: Without dead ends: 860 [2024-11-11 20:35:51,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:35:51,269 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 1521 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1600 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 3199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:51,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1600 Valid, 1666 Invalid, 3199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 2836 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-11 20:35:51,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2024-11-11 20:35:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 595. [2024-11-11 20:35:51,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 467 states have (on average 1.6038543897216273) internal successors, (749), 488 states have internal predecessors, (749), 100 states have call successors, (100), 26 states have call predecessors, (100), 27 states have return successors, (97), 93 states have call predecessors, (97), 95 states have call successors, (97) [2024-11-11 20:35:51,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 946 transitions. [2024-11-11 20:35:51,370 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 946 transitions. Word has length 117 [2024-11-11 20:35:51,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:51,371 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 946 transitions. [2024-11-11 20:35:51,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:51,371 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 946 transitions. [2024-11-11 20:35:51,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 20:35:51,373 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:51,373 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:51,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:35:51,373 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:51,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:51,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1990376799, now seen corresponding path program 1 times [2024-11-11 20:35:51,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:51,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875374760] [2024-11-11 20:35:51,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:51,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:51,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:51,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:51,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:51,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:35:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:51,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:51,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:51,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:51,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:51,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:35:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:51,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:51,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:51,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:51,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:35:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:51,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:35:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:51,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:35:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:35:51,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875374760] [2024-11-11 20:35:51,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875374760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:51,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:51,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:35:51,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134307651] [2024-11-11 20:35:51,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:51,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:35:51,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:51,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:35:51,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:35:51,836 INFO L87 Difference]: Start difference. First operand 595 states and 946 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:55,482 INFO L93 Difference]: Finished difference Result 1374 states and 2244 transitions. [2024-11-11 20:35:55,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:35:55,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-11-11 20:35:55,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:55,487 INFO L225 Difference]: With dead ends: 1374 [2024-11-11 20:35:55,487 INFO L226 Difference]: Without dead ends: 856 [2024-11-11 20:35:55,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:35:55,489 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 1963 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 2674 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2042 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 2674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:55,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2042 Valid, 1605 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 2674 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 20:35:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2024-11-11 20:35:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 599. [2024-11-11 20:35:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 471 states have (on average 1.5966029723991508) internal successors, (752), 492 states have internal predecessors, (752), 100 states have call successors, (100), 26 states have call predecessors, (100), 27 states have return successors, (97), 93 states have call predecessors, (97), 95 states have call successors, (97) [2024-11-11 20:35:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 949 transitions. [2024-11-11 20:35:55,593 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 949 transitions. Word has length 118 [2024-11-11 20:35:55,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:55,594 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 949 transitions. [2024-11-11 20:35:55,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 949 transitions. [2024-11-11 20:35:55,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 20:35:55,595 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:55,596 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:55,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:35:55,596 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:55,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:55,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1724896127, now seen corresponding path program 1 times [2024-11-11 20:35:55,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:55,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012532840] [2024-11-11 20:35:55,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:55,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:55,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:35:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:55,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:55,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:56,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:35:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:56,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:56,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:56,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:56,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:56,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:35:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:56,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:56,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:35:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:56,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:35:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:56,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:35:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:56,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:35:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:56,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:35:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:35:56,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:56,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012532840] [2024-11-11 20:35:56,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012532840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:56,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:56,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:35:56,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304783495] [2024-11-11 20:35:56,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:56,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:35:56,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:56,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:35:56,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:35:56,101 INFO L87 Difference]: Start difference. First operand 599 states and 949 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:59,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:59,794 INFO L93 Difference]: Finished difference Result 1429 states and 2307 transitions. [2024-11-11 20:35:59,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:35:59,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-11-11 20:35:59,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:59,798 INFO L225 Difference]: With dead ends: 1429 [2024-11-11 20:35:59,798 INFO L226 Difference]: Without dead ends: 828 [2024-11-11 20:35:59,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:35:59,802 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 1444 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 2829 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 3189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 2829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:59,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1654 Invalid, 3189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 2829 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 20:35:59,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-11-11 20:35:59,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 580. [2024-11-11 20:35:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 455 states have (on average 1.6043956043956045) internal successors, (730), 474 states have internal predecessors, (730), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-11 20:35:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 923 transitions. [2024-11-11 20:35:59,902 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 923 transitions. Word has length 118 [2024-11-11 20:35:59,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:59,902 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 923 transitions. [2024-11-11 20:35:59,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:35:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 923 transitions. [2024-11-11 20:35:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 20:35:59,904 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:59,904 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:59,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:35:59,904 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:59,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:59,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1532932511, now seen corresponding path program 1 times [2024-11-11 20:35:59,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:59,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452853695] [2024-11-11 20:35:59,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:59,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:00,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:36:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:00,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:00,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:36:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:00,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:36:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:00,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:00,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:00,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:00,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:36:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:00,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:36:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:00,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:00,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:00,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:36:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:00,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:36:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:00,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:36:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:00,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:36:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:36:00,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:36:00,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452853695] [2024-11-11 20:36:00,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452853695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:36:00,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:36:00,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:36:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480387223] [2024-11-11 20:36:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:36:00,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:36:00,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:36:00,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:36:00,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:36:00,401 INFO L87 Difference]: Start difference. First operand 580 states and 923 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:36:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:36:05,816 INFO L93 Difference]: Finished difference Result 1353 states and 2209 transitions. [2024-11-11 20:36:05,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:36:05,817 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2024-11-11 20:36:05,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:36:05,821 INFO L225 Difference]: With dead ends: 1353 [2024-11-11 20:36:05,821 INFO L226 Difference]: Without dead ends: 838 [2024-11-11 20:36:05,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:36:05,823 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 992 mSDsluCounter, 2561 mSDsCounter, 0 mSdLazyCounter, 5192 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 5399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 5192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:36:05,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 2999 Invalid, 5399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 5192 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-11 20:36:05,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-11 20:36:05,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 585. [2024-11-11 20:36:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 460 states have (on average 1.5978260869565217) internal successors, (735), 479 states have internal predecessors, (735), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-11 20:36:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 928 transitions. [2024-11-11 20:36:05,926 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 928 transitions. Word has length 119 [2024-11-11 20:36:05,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:36:05,926 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 928 transitions. [2024-11-11 20:36:05,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:36:05,926 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 928 transitions. [2024-11-11 20:36:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-11 20:36:05,928 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:36:05,928 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:36:05,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:36:05,928 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:36:05,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:36:05,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1646774580, now seen corresponding path program 1 times [2024-11-11 20:36:05,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:36:05,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622549009] [2024-11-11 20:36:05,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:36:05,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:36:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:06,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:36:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:06,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:06,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:36:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:06,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:36:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:06,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:06,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:06,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:36:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:36:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:06,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:06,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:06,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:36:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:06,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:36:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:06,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:36:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:06,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:36:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:36:06,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:36:06,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622549009] [2024-11-11 20:36:06,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622549009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:36:06,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:36:06,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:36:06,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754324836] [2024-11-11 20:36:06,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:36:06,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:36:06,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:36:06,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:36:06,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:36:06,349 INFO L87 Difference]: Start difference. First operand 585 states and 928 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:36:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:36:10,666 INFO L93 Difference]: Finished difference Result 1365 states and 2220 transitions. [2024-11-11 20:36:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:36:10,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-11-11 20:36:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:36:10,671 INFO L225 Difference]: With dead ends: 1365 [2024-11-11 20:36:10,672 INFO L226 Difference]: Without dead ends: 829 [2024-11-11 20:36:10,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:36:10,674 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 1008 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 2867 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 3068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 2867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:36:10,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 1735 Invalid, 3068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 2867 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-11 20:36:10,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-11-11 20:36:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 585. [2024-11-11 20:36:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 460 states have (on average 1.5891304347826087) internal successors, (731), 479 states have internal predecessors, (731), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-11 20:36:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 924 transitions. [2024-11-11 20:36:10,844 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 924 transitions. Word has length 120 [2024-11-11 20:36:10,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:36:10,845 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 924 transitions. [2024-11-11 20:36:10,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:36:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 924 transitions. [2024-11-11 20:36:10,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-11 20:36:10,850 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:36:10,850 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:36:10,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:36:10,851 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:36:10,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:36:10,851 INFO L85 PathProgramCache]: Analyzing trace with hash -230288650, now seen corresponding path program 1 times [2024-11-11 20:36:10,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:36:10,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627398357] [2024-11-11 20:36:10,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:36:10,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:36:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:11,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:36:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:11,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:11,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:36:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:11,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:36:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:11,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:11,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:11,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:11,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:36:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:11,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:36:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:11,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:11,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:36:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:11,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:36:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:11,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:36:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:11,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:36:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:11,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:36:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:36:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:36:11,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:36:11,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627398357] [2024-11-11 20:36:11,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627398357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:36:11,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:36:11,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:36:11,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017635763] [2024-11-11 20:36:11,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:36:11,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:36:11,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:36:11,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:36:11,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:36:11,592 INFO L87 Difference]: Start difference. First operand 585 states and 924 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14)