./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.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 d5d3c0f581b3d52ccfb3e43d6fb6458a66cd40c307750c0d7336040b60b78e76 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:46:17,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:46:17,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:46:17,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:46:17,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:46:17,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:46:17,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:46:17,740 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:46:17,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:46:17,742 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:46:17,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:46:17,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:46:17,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:46:17,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:46:17,745 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:46:17,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:46:17,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:46:17,746 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:46:17,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:46:17,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:46:17,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:46:17,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:46:17,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:46:17,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:46:17,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:46:17,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:46:17,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:46:17,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:46:17,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:46:17,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:46:17,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:46:17,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:46:17,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:46:17,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:46:17,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:46:17,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:46:17,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:46:17,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:46:17,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:46:17,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:46:17,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:46:17,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:46:17,756 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 -> d5d3c0f581b3d52ccfb3e43d6fb6458a66cd40c307750c0d7336040b60b78e76 [2024-11-19 21:46:17,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:46:18,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:46:18,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:46:18,021 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:46:18,021 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:46:18,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c [2024-11-19 21:46:19,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:46:19,730 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:46:19,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c [2024-11-19 21:46:19,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40b01cab9/112ce86ea3fc436bb3cbfdc060409b4e/FLAGe104d0df3 [2024-11-19 21:46:20,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40b01cab9/112ce86ea3fc436bb3cbfdc060409b4e [2024-11-19 21:46:20,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:46:20,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:46:20,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:46:20,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:46:20,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:46:20,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:46:20" (1/1) ... [2024-11-19 21:46:20,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@475b7a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:20, skipping insertion in model container [2024-11-19 21:46:20,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:46:20" (1/1) ... [2024-11-19 21:46:20,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:46:20,531 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_product26.cil.c[46529,46542] [2024-11-19 21:46:20,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:46:20,621 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:46:20,630 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2024-11-19 21:46:20,632 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [414] [2024-11-19 21:46:20,632 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [428] [2024-11-19 21:46:20,633 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [594] [2024-11-19 21:46:20,633 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2119] [2024-11-19 21:46:20,634 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2128] [2024-11-19 21:46:20,634 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2790] [2024-11-19 21:46:20,634 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3145] [2024-11-19 21:46:20,634 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3236] [2024-11-19 21:46:20,635 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3271] [2024-11-19 21:46:20,704 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_product26.cil.c[46529,46542] [2024-11-19 21:46:20,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:46:20,776 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:46:20,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:20 WrapperNode [2024-11-19 21:46:20,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:46:20,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:46:20,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:46:20,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:46:20,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:20" (1/1) ... [2024-11-19 21:46:20,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:20" (1/1) ... [2024-11-19 21:46:20,875 INFO L138 Inliner]: procedures = 93, calls = 337, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 813 [2024-11-19 21:46:20,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:46:20,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:46:20,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:46:20,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:46:20,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:20" (1/1) ... [2024-11-19 21:46:20,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:20" (1/1) ... [2024-11-19 21:46:20,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:20" (1/1) ... [2024-11-19 21:46:20,923 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-11-19 21:46:20,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:20" (1/1) ... [2024-11-19 21:46:20,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:20" (1/1) ... [2024-11-19 21:46:20,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:20" (1/1) ... [2024-11-19 21:46:20,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:20" (1/1) ... [2024-11-19 21:46:20,989 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:20" (1/1) ... [2024-11-19 21:46:20,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:20" (1/1) ... [2024-11-19 21:46:21,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:46:21,014 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:46:21,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:46:21,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:46:21,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:20" (1/1) ... [2024-11-19 21:46:21,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:46:21,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:46:21,049 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-19 21:46:21,056 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-19 21:46:21,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:46:21,102 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-19 21:46:21,102 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-19 21:46:21,102 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-19 21:46:21,102 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-19 21:46:21,102 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-19 21:46:21,102 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-19 21:46:21,103 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-19 21:46:21,103 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-19 21:46:21,103 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-19 21:46:21,104 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-19 21:46:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-19 21:46:21,104 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-19 21:46:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-19 21:46:21,105 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-19 21:46:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-11-19 21:46:21,105 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-11-19 21:46:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-19 21:46:21,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-19 21:46:21,106 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-19 21:46:21,106 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-19 21:46:21,106 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-19 21:46:21,107 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-19 21:46:21,107 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-19 21:46:21,107 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-19 21:46:21,107 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-19 21:46:21,107 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-19 21:46:21,107 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-19 21:46:21,108 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-19 21:46:21,108 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2024-11-19 21:46:21,108 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2024-11-19 21:46:21,109 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-19 21:46:21,109 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-19 21:46:21,109 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-19 21:46:21,109 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-19 21:46:21,109 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-19 21:46:21,110 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-19 21:46:21,110 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-11-19 21:46:21,110 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-11-19 21:46:21,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:46:21,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 21:46:21,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 21:46:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 21:46:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 21:46:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 21:46:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 21:46:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 21:46:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 21:46:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 21:46:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 21:46:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 21:46:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 21:46:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-19 21:46:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-19 21:46:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-19 21:46:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-19 21:46:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-19 21:46:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-19 21:46:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-19 21:46:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-19 21:46:21,114 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-19 21:46:21,114 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-19 21:46:21,114 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-19 21:46:21,114 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-19 21:46:21,114 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-19 21:46:21,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:46:21,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:46:21,114 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-19 21:46:21,114 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-19 21:46:21,322 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:46:21,326 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:46:22,394 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2024-11-19 21:46:22,395 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:46:22,434 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:46:22,434 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 21:46:22,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:46:22 BoogieIcfgContainer [2024-11-19 21:46:22,434 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:46:22,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:46:22,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:46:22,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:46:22,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:46:20" (1/3) ... [2024-11-19 21:46:22,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ec33e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:46:22, skipping insertion in model container [2024-11-19 21:46:22,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:20" (2/3) ... [2024-11-19 21:46:22,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ec33e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:46:22, skipping insertion in model container [2024-11-19 21:46:22,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:46:22" (3/3) ... [2024-11-19 21:46:22,443 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product26.cil.c [2024-11-19 21:46:22,458 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:46:22,459 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:46:22,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:46:22,548 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;@64c439cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:46:22,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:46:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 545 states, 431 states have (on average 1.7076566125290022) internal successors, (736), 454 states have internal predecessors, (736), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (89), 82 states have call predecessors, (89), 89 states have call successors, (89) [2024-11-19 21:46:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 21:46:22,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:46:22,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:46:22,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:46:22,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:46:22,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1868940779, now seen corresponding path program 1 times [2024-11-19 21:46:22,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:46:22,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044721680] [2024-11-19 21:46:22,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:46:22,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:46:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:23,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:46:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:23,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:23,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:46:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:23,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 21:46:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:23,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:23,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:23,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:46:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:46:23,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:46:23,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044721680] [2024-11-19 21:46:23,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044721680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:46:23,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:46:23,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:46:23,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293579062] [2024-11-19 21:46:23,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:46:23,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:46:23,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:46:23,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:46:23,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:46:23,906 INFO L87 Difference]: Start difference. First operand has 545 states, 431 states have (on average 1.7076566125290022) internal successors, (736), 454 states have internal predecessors, (736), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (89), 82 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:46:28,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:46:28,757 INFO L93 Difference]: Finished difference Result 1223 states and 2080 transitions. [2024-11-19 21:46:28,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:46:28,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-11-19 21:46:28,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:46:28,793 INFO L225 Difference]: With dead ends: 1223 [2024-11-19 21:46:28,793 INFO L226 Difference]: Without dead ends: 690 [2024-11-19 21:46:28,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:46:28,808 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 672 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 2674 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:46:28,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 1157 Invalid, 2786 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [112 Valid, 2674 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-19 21:46:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-19 21:46:28,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 537. [2024-11-19 21:46:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 425 states have (on average 1.703529411764706) internal successors, (724), 446 states have internal predecessors, (724), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-19 21:46:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 897 transitions. [2024-11-19 21:46:28,983 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 897 transitions. Word has length 58 [2024-11-19 21:46:28,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:46:28,984 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 897 transitions. [2024-11-19 21:46:28,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:46:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 897 transitions. [2024-11-19 21:46:28,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 21:46:28,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:46:28,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:46:28,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 21:46:28,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:46:28,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:46:28,995 INFO L85 PathProgramCache]: Analyzing trace with hash 49721393, now seen corresponding path program 1 times [2024-11-19 21:46:28,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:46:28,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069522192] [2024-11-19 21:46:28,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:46:28,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:46:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:29,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:46:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:29,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:29,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:46:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:29,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-19 21:46:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:29,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:29,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:29,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:46:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:46:29,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:46:29,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069522192] [2024-11-19 21:46:29,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069522192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:46:29,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:46:29,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:46:29,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949804904] [2024-11-19 21:46:29,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:46:29,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:46:29,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:46:29,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:46:29,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:46:29,655 INFO L87 Difference]: Start difference. First operand 537 states and 897 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:46:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:46:33,933 INFO L93 Difference]: Finished difference Result 1209 states and 2046 transitions. [2024-11-19 21:46:33,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:46:33,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2024-11-19 21:46:33,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:46:33,940 INFO L225 Difference]: With dead ends: 1209 [2024-11-19 21:46:33,940 INFO L226 Difference]: Without dead ends: 690 [2024-11-19 21:46:33,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:46:33,944 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 669 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 2682 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 2794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:46:33,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1108 Invalid, 2794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2682 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-19 21:46:33,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-19 21:46:34,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 537. [2024-11-19 21:46:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 425 states have (on average 1.7011764705882353) internal successors, (723), 446 states have internal predecessors, (723), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-19 21:46:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 896 transitions. [2024-11-19 21:46:34,071 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 896 transitions. Word has length 61 [2024-11-19 21:46:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:46:34,072 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 896 transitions. [2024-11-19 21:46:34,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:46:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 896 transitions. [2024-11-19 21:46:34,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 21:46:34,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:46:34,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:46:34,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 21:46:34,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:46:34,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:46:34,078 INFO L85 PathProgramCache]: Analyzing trace with hash -343579, now seen corresponding path program 1 times [2024-11-19 21:46:34,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:46:34,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136596192] [2024-11-19 21:46:34,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:46:34,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:46:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:34,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:46:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:34,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:34,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:46:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:34,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-19 21:46:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:34,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:34,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:34,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:46:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:46:34,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:46:34,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136596192] [2024-11-19 21:46:34,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136596192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:46:34,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:46:34,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:46:34,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151339244] [2024-11-19 21:46:34,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:46:34,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:46:34,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:46:34,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:46:34,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:46:34,727 INFO L87 Difference]: Start difference. First operand 537 states and 896 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:46:38,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:46:38,306 INFO L93 Difference]: Finished difference Result 1209 states and 2045 transitions. [2024-11-19 21:46:38,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:46:38,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2024-11-19 21:46:38,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:46:38,314 INFO L225 Difference]: With dead ends: 1209 [2024-11-19 21:46:38,314 INFO L226 Difference]: Without dead ends: 690 [2024-11-19 21:46:38,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:46:38,318 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 1109 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:46:38,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 1103 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-19 21:46:38,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-19 21:46:38,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 537. [2024-11-19 21:46:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 425 states have (on average 1.6988235294117646) internal successors, (722), 446 states have internal predecessors, (722), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-19 21:46:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 895 transitions. [2024-11-19 21:46:38,402 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 895 transitions. Word has length 62 [2024-11-19 21:46:38,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:46:38,402 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 895 transitions. [2024-11-19 21:46:38,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:46:38,403 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 895 transitions. [2024-11-19 21:46:38,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 21:46:38,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:46:38,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:46:38,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 21:46:38,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:46:38,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:46:38,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1969000915, now seen corresponding path program 1 times [2024-11-19 21:46:38,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:46:38,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732105679] [2024-11-19 21:46:38,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:46:38,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:46:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:38,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:46:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:38,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:38,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:46:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:38,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:46:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:38,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:46:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:46:38,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:46:38,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732105679] [2024-11-19 21:46:38,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732105679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:46:38,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:46:38,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:46:38,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879871060] [2024-11-19 21:46:38,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:46:38,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:46:38,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:46:38,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:46:38,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:46:38,960 INFO L87 Difference]: Start difference. First operand 537 states and 895 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:46:42,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:46:42,662 INFO L93 Difference]: Finished difference Result 1209 states and 2044 transitions. [2024-11-19 21:46:42,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:46:42,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2024-11-19 21:46:42,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:46:42,667 INFO L225 Difference]: With dead ends: 1209 [2024-11-19 21:46:42,667 INFO L226 Difference]: Without dead ends: 690 [2024-11-19 21:46:42,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:46:42,671 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 666 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 2665 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:46:42,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 1117 Invalid, 2777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2665 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 21:46:42,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-19 21:46:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 537. [2024-11-19 21:46:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 425 states have (on average 1.6964705882352942) internal successors, (721), 446 states have internal predecessors, (721), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-19 21:46:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 894 transitions. [2024-11-19 21:46:42,752 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 894 transitions. Word has length 63 [2024-11-19 21:46:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:46:42,752 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 894 transitions. [2024-11-19 21:46:42,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:46:42,753 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 894 transitions. [2024-11-19 21:46:42,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 21:46:42,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:46:42,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:46:42,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 21:46:42,754 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:46:42,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:46:42,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1010487905, now seen corresponding path program 1 times [2024-11-19 21:46:42,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:46:42,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922889778] [2024-11-19 21:46:42,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:46:42,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:46:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:42,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:46:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:42,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:43,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 21:46:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:43,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:46:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:43,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:43,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:43,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:46:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:46:43,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:46:43,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922889778] [2024-11-19 21:46:43,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922889778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:46:43,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:46:43,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:46:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088536009] [2024-11-19 21:46:43,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:46:43,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:46:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:46:43,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:46:43,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:46:43,354 INFO L87 Difference]: Start difference. First operand 537 states and 894 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:46:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:46:46,881 INFO L93 Difference]: Finished difference Result 1209 states and 2043 transitions. [2024-11-19 21:46:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:46:46,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2024-11-19 21:46:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:46:46,886 INFO L225 Difference]: With dead ends: 1209 [2024-11-19 21:46:46,886 INFO L226 Difference]: Without dead ends: 690 [2024-11-19 21:46:46,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:46:46,890 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1107 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 2511 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 2511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:46:46,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 1079 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 2511 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-19 21:46:46,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-19 21:46:46,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 537. [2024-11-19 21:46:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 425 states have (on average 1.6941176470588235) internal successors, (720), 446 states have internal predecessors, (720), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-19 21:46:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 893 transitions. [2024-11-19 21:46:46,969 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 893 transitions. Word has length 64 [2024-11-19 21:46:46,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:46:46,970 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 893 transitions. [2024-11-19 21:46:46,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:46:46,972 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 893 transitions. [2024-11-19 21:46:46,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 21:46:46,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:46:46,973 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:46:46,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 21:46:46,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:46:46,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:46:46,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1531282391, now seen corresponding path program 1 times [2024-11-19 21:46:46,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:46:46,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435163262] [2024-11-19 21:46:46,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:46:46,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:46:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:47,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:46:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:47,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:47,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:46:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:47,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:46:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:47,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:47,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:47,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:46:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:46:47,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:46:47,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435163262] [2024-11-19 21:46:47,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435163262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:46:47,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:46:47,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:46:47,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417236732] [2024-11-19 21:46:47,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:46:47,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:46:47,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:46:47,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:46:47,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:46:47,637 INFO L87 Difference]: Start difference. First operand 537 states and 893 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-19 21:46:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:46:52,884 INFO L93 Difference]: Finished difference Result 1186 states and 1993 transitions. [2024-11-19 21:46:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:46:52,884 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-19 21:46:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:46:52,889 INFO L225 Difference]: With dead ends: 1186 [2024-11-19 21:46:52,889 INFO L226 Difference]: Without dead ends: 716 [2024-11-19 21:46:52,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-19 21:46:52,893 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 1195 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 4700 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 4942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 4700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:46:52,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 1986 Invalid, 4942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 4700 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-19 21:46:52,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-11-19 21:46:52,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 550. [2024-11-19 21:46:52,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 435 states have (on average 1.6896551724137931) internal successors, (735), 458 states have internal predecessors, (735), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-11-19 21:46:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 912 transitions. [2024-11-19 21:46:52,979 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 912 transitions. Word has length 65 [2024-11-19 21:46:52,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:46:52,980 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 912 transitions. [2024-11-19 21:46:52,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-19 21:46:52,980 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 912 transitions. [2024-11-19 21:46:52,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 21:46:52,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:46:52,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:46:52,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:46:52,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:46:52,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:46:52,985 INFO L85 PathProgramCache]: Analyzing trace with hash -561701368, now seen corresponding path program 1 times [2024-11-19 21:46:52,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:46:52,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570917164] [2024-11-19 21:46:52,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:46:52,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:46:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:53,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:46:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:53,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:53,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:46:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:53,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:46:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:53,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:53,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:53,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:46:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:46:53,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:46:53,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570917164] [2024-11-19 21:46:53,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570917164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:46:53,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:46:53,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:46:53,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723667709] [2024-11-19 21:46:53,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:46:53,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:46:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:46:53,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:46:53,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:46:53,526 INFO L87 Difference]: Start difference. First operand 550 states and 912 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:46:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:46:56,908 INFO L93 Difference]: Finished difference Result 1212 states and 2035 transitions. [2024-11-19 21:46:56,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:46:56,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-19 21:46:56,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:46:56,913 INFO L225 Difference]: With dead ends: 1212 [2024-11-19 21:46:56,914 INFO L226 Difference]: Without dead ends: 724 [2024-11-19 21:46:56,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:46:56,916 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 725 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 2629 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:46:56,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1117 Invalid, 2747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2629 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-19 21:46:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-19 21:46:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 550. [2024-11-19 21:46:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 435 states have (on average 1.6781609195402298) internal successors, (730), 458 states have internal predecessors, (730), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-11-19 21:46:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 907 transitions. [2024-11-19 21:46:56,999 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 907 transitions. Word has length 65 [2024-11-19 21:46:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:46:57,000 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 907 transitions. [2024-11-19 21:46:57,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:46:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 907 transitions. [2024-11-19 21:46:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 21:46:57,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:46:57,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:46:57,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 21:46:57,002 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:46:57,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:46:57,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1632909725, now seen corresponding path program 1 times [2024-11-19 21:46:57,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:46:57,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282707175] [2024-11-19 21:46:57,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:46:57,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:46:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:46:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:46:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 21:46:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:46:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:46:57,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:46:57,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282707175] [2024-11-19 21:46:57,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282707175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:46:57,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:46:57,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:46:57,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24180279] [2024-11-19 21:46:57,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:46:57,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:46:57,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:46:57,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:46:57,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:46:57,526 INFO L87 Difference]: Start difference. First operand 550 states and 907 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:47:00,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:00,611 INFO L93 Difference]: Finished difference Result 1212 states and 2030 transitions. [2024-11-19 21:47:00,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:47:00,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-19 21:47:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:00,616 INFO L225 Difference]: With dead ends: 1212 [2024-11-19 21:47:00,616 INFO L226 Difference]: Without dead ends: 724 [2024-11-19 21:47:00,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:47:00,619 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 1168 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 2453 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 2693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 2453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:00,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 1115 Invalid, 2693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 2453 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-19 21:47:00,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-19 21:47:00,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 550. [2024-11-19 21:47:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 435 states have (on average 1.6666666666666667) internal successors, (725), 458 states have internal predecessors, (725), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-11-19 21:47:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 902 transitions. [2024-11-19 21:47:00,729 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 902 transitions. Word has length 66 [2024-11-19 21:47:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:00,729 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 902 transitions. [2024-11-19 21:47:00,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:47:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 902 transitions. [2024-11-19 21:47:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 21:47:00,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:00,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:00,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 21:47:00,734 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:00,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:00,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1568997267, now seen corresponding path program 1 times [2024-11-19 21:47:00,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:00,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721783120] [2024-11-19 21:47:00,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:00,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:00,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:00,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:00,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:01,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 21:47:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:01,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:01,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:01,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:47:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:01,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:01,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721783120] [2024-11-19 21:47:01,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721783120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:01,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:01,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:47:01,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969175294] [2024-11-19 21:47:01,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:01,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:47:01,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:01,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:47:01,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:47:01,223 INFO L87 Difference]: Start difference. First operand 550 states and 902 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:47:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:04,652 INFO L93 Difference]: Finished difference Result 1212 states and 2025 transitions. [2024-11-19 21:47:04,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:47:04,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2024-11-19 21:47:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:04,657 INFO L225 Difference]: With dead ends: 1212 [2024-11-19 21:47:04,657 INFO L226 Difference]: Without dead ends: 724 [2024-11-19 21:47:04,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:47:04,659 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 722 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 2701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:04,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1094 Invalid, 2701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-19 21:47:04,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-19 21:47:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 550. [2024-11-19 21:47:04,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 435 states have (on average 1.6551724137931034) internal successors, (720), 458 states have internal predecessors, (720), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-11-19 21:47:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 897 transitions. [2024-11-19 21:47:04,744 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 897 transitions. Word has length 67 [2024-11-19 21:47:04,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:04,745 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 897 transitions. [2024-11-19 21:47:04,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:47:04,745 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 897 transitions. [2024-11-19 21:47:04,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 21:47:04,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:04,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:04,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 21:47:04,747 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:04,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1284448200, now seen corresponding path program 1 times [2024-11-19 21:47:04,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:04,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801253823] [2024-11-19 21:47:04,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:04,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:04,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:04,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:04,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:05,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 21:47:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:05,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:05,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:05,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:47:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:05,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:05,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801253823] [2024-11-19 21:47:05,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801253823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:05,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:05,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:47:05,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335752369] [2024-11-19 21:47:05,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:05,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:47:05,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:05,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:47:05,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:47:05,334 INFO L87 Difference]: Start difference. First operand 550 states and 897 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:47:09,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:09,051 INFO L93 Difference]: Finished difference Result 1185 states and 1976 transitions. [2024-11-19 21:47:09,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:47:09,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-11-19 21:47:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:09,056 INFO L225 Difference]: With dead ends: 1185 [2024-11-19 21:47:09,056 INFO L226 Difference]: Without dead ends: 712 [2024-11-19 21:47:09,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:47:09,059 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 710 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 2655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:09,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1060 Invalid, 2655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-19 21:47:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-11-19 21:47:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 550. [2024-11-19 21:47:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 435 states have (on average 1.6528735632183909) internal successors, (719), 458 states have internal predecessors, (719), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-11-19 21:47:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 896 transitions. [2024-11-19 21:47:09,145 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 896 transitions. Word has length 68 [2024-11-19 21:47:09,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:09,145 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 896 transitions. [2024-11-19 21:47:09,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:47:09,145 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 896 transitions. [2024-11-19 21:47:09,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 21:47:09,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:09,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:09,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 21:47:09,147 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:09,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:09,148 INFO L85 PathProgramCache]: Analyzing trace with hash -676077912, now seen corresponding path program 1 times [2024-11-19 21:47:09,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:09,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576584697] [2024-11-19 21:47:09,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:09,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:09,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:09,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:09,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:09,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 21:47:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:09,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:09,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:09,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:47:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:09,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:09,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576584697] [2024-11-19 21:47:09,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576584697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:09,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:09,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:47:09,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351564423] [2024-11-19 21:47:09,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:09,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:47:09,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:09,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:47:09,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:47:09,696 INFO L87 Difference]: Start difference. First operand 550 states and 896 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:47:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:12,773 INFO L93 Difference]: Finished difference Result 1212 states and 2016 transitions. [2024-11-19 21:47:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:47:12,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-11-19 21:47:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:12,778 INFO L225 Difference]: With dead ends: 1212 [2024-11-19 21:47:12,778 INFO L226 Difference]: Without dead ends: 724 [2024-11-19 21:47:12,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:47:12,780 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 1171 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 2400 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 2651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 2400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:12,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 1072 Invalid, 2651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 2400 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 21:47:12,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-19 21:47:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 550. [2024-11-19 21:47:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 435 states have (on average 1.6413793103448275) internal successors, (714), 458 states have internal predecessors, (714), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-11-19 21:47:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 891 transitions. [2024-11-19 21:47:12,867 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 891 transitions. Word has length 68 [2024-11-19 21:47:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:12,867 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 891 transitions. [2024-11-19 21:47:12,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 21:47:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 891 transitions. [2024-11-19 21:47:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 21:47:12,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:12,869 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:12,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 21:47:12,869 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:12,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:12,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1924060336, now seen corresponding path program 1 times [2024-11-19 21:47:12,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:12,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911142827] [2024-11-19 21:47:12,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:12,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:13,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:13,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:13,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:13,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:47:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:13,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:13,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:13,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:47:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:13,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:13,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911142827] [2024-11-19 21:47:13,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911142827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:13,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:13,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:47:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141141552] [2024-11-19 21:47:13,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:13,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:47:13,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:47:13,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:47:13,570 INFO L87 Difference]: Start difference. First operand 550 states and 891 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-19 21:47:19,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:19,679 INFO L93 Difference]: Finished difference Result 1204 states and 1998 transitions. [2024-11-19 21:47:19,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 21:47:19,680 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2024-11-19 21:47:19,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:19,684 INFO L225 Difference]: With dead ends: 1204 [2024-11-19 21:47:19,684 INFO L226 Difference]: Without dead ends: 728 [2024-11-19 21:47:19,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-11-19 21:47:19,687 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 712 mSDsluCounter, 2438 mSDsCounter, 0 mSdLazyCounter, 6752 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 2750 SdHoareTripleChecker+Invalid, 6879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 6752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:19,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 2750 Invalid, 6879 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [127 Valid, 6752 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-19 21:47:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-11-19 21:47:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 557. [2024-11-19 21:47:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 441 states have (on average 1.6303854875283448) internal successors, (719), 464 states have internal predecessors, (719), 90 states have call successors, (90), 23 states have call predecessors, (90), 25 states have return successors, (89), 83 states have call predecessors, (89), 85 states have call successors, (89) [2024-11-19 21:47:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 898 transitions. [2024-11-19 21:47:19,808 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 898 transitions. Word has length 69 [2024-11-19 21:47:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:19,808 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 898 transitions. [2024-11-19 21:47:19,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-19 21:47:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 898 transitions. [2024-11-19 21:47:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 21:47:19,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:19,810 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 21:47:19,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 21:47:19,811 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:19,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash 245127023, now seen corresponding path program 1 times [2024-11-19 21:47:19,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:19,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945695004] [2024-11-19 21:47:19,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:19,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:19,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:47:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:47:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 21:47:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:47:20,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:20,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945695004] [2024-11-19 21:47:20,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945695004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:20,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:20,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:47:20,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113909529] [2024-11-19 21:47:20,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:20,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:47:20,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:20,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:47:20,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:47:20,310 INFO L87 Difference]: Start difference. First operand 557 states and 898 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:23,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:23,454 INFO L93 Difference]: Finished difference Result 1231 states and 2029 transitions. [2024-11-19 21:47:23,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:47:23,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2024-11-19 21:47:23,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:23,460 INFO L225 Difference]: With dead ends: 1231 [2024-11-19 21:47:23,460 INFO L226 Difference]: Without dead ends: 736 [2024-11-19 21:47:23,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:47:23,462 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 1166 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:23,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 1087 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-19 21:47:23,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-19 21:47:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 557. [2024-11-19 21:47:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 441 states have (on average 1.619047619047619) internal successors, (714), 464 states have internal predecessors, (714), 90 states have call successors, (90), 23 states have call predecessors, (90), 25 states have return successors, (89), 83 states have call predecessors, (89), 85 states have call successors, (89) [2024-11-19 21:47:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 893 transitions. [2024-11-19 21:47:23,554 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 893 transitions. Word has length 75 [2024-11-19 21:47:23,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:23,554 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 893 transitions. [2024-11-19 21:47:23,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 893 transitions. [2024-11-19 21:47:23,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 21:47:23,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:23,556 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 21:47:23,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 21:47:23,556 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:23,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:23,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1929474410, now seen corresponding path program 1 times [2024-11-19 21:47:23,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:23,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914306255] [2024-11-19 21:47:23,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:23,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:23,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:23,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:23,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:24,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:47:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:24,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:24,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:47:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:24,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 21:47:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:47:24,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:24,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914306255] [2024-11-19 21:47:24,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914306255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:24,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:24,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:47:24,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732613083] [2024-11-19 21:47:24,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:24,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:47:24,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:24,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:47:24,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:47:24,170 INFO L87 Difference]: Start difference. First operand 557 states and 893 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 21:47:28,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:28,882 INFO L93 Difference]: Finished difference Result 1216 states and 1998 transitions. [2024-11-19 21:47:28,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:47:28,882 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2024-11-19 21:47:28,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:28,886 INFO L225 Difference]: With dead ends: 1216 [2024-11-19 21:47:28,886 INFO L226 Difference]: Without dead ends: 736 [2024-11-19 21:47:28,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:47:28,888 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1149 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 4479 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 4727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 4479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:28,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1225 Valid, 1925 Invalid, 4727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 4479 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-19 21:47:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-19 21:47:28,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 561. [2024-11-19 21:47:28,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 445 states have (on average 1.6112359550561797) internal successors, (717), 468 states have internal predecessors, (717), 90 states have call successors, (90), 23 states have call predecessors, (90), 25 states have return successors, (89), 83 states have call predecessors, (89), 85 states have call successors, (89) [2024-11-19 21:47:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 896 transitions. [2024-11-19 21:47:28,979 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 896 transitions. Word has length 76 [2024-11-19 21:47:28,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:28,979 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 896 transitions. [2024-11-19 21:47:28,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 21:47:28,980 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 896 transitions. [2024-11-19 21:47:28,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 21:47:28,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:28,981 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 21:47:28,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 21:47:28,982 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:28,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:28,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2083828554, now seen corresponding path program 1 times [2024-11-19 21:47:28,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:28,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670494585] [2024-11-19 21:47:28,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:28,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:29,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:29,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:29,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:29,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:47:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:29,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:29,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:29,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:47:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:29,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 21:47:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:47:29,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:29,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670494585] [2024-11-19 21:47:29,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670494585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:29,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:29,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:47:29,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894097201] [2024-11-19 21:47:29,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:29,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:47:29,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:29,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:47:29,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:47:29,498 INFO L87 Difference]: Start difference. First operand 561 states and 896 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:32,841 INFO L93 Difference]: Finished difference Result 1267 states and 2057 transitions. [2024-11-19 21:47:32,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:47:32,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2024-11-19 21:47:32,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:32,847 INFO L225 Difference]: With dead ends: 1267 [2024-11-19 21:47:32,847 INFO L226 Difference]: Without dead ends: 704 [2024-11-19 21:47:32,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:47:32,850 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 1103 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 2400 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 2647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 2400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:32,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 1046 Invalid, 2647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 2400 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 21:47:32,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-19 21:47:32,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 542. [2024-11-19 21:47:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 429 states have (on average 1.6200466200466201) internal successors, (695), 450 states have internal predecessors, (695), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (86), 82 states have call predecessors, (86), 84 states have call successors, (86) [2024-11-19 21:47:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 870 transitions. [2024-11-19 21:47:32,936 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 870 transitions. Word has length 76 [2024-11-19 21:47:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:32,936 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 870 transitions. [2024-11-19 21:47:32,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:32,937 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 870 transitions. [2024-11-19 21:47:32,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 21:47:32,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:32,939 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 21:47:32,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 21:47:32,939 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:32,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:32,939 INFO L85 PathProgramCache]: Analyzing trace with hash 715869938, now seen corresponding path program 1 times [2024-11-19 21:47:32,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:32,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669490414] [2024-11-19 21:47:32,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:32,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:33,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:33,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:33,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:33,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-19 21:47:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:33,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:33,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:33,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:47:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:33,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 21:47:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:47:33,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:33,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669490414] [2024-11-19 21:47:33,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669490414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:33,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:33,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:47:33,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181604345] [2024-11-19 21:47:33,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:33,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:47:33,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:33,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:47:33,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:47:33,600 INFO L87 Difference]: Start difference. First operand 542 states and 870 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 21:47:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:38,554 INFO L93 Difference]: Finished difference Result 1191 states and 1959 transitions. [2024-11-19 21:47:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:47:38,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 77 [2024-11-19 21:47:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:38,559 INFO L225 Difference]: With dead ends: 1191 [2024-11-19 21:47:38,560 INFO L226 Difference]: Without dead ends: 714 [2024-11-19 21:47:38,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:47:38,561 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 682 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 4546 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 4666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 4546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:38,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1906 Invalid, 4666 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [120 Valid, 4546 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-19 21:47:38,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-11-19 21:47:38,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 547. [2024-11-19 21:47:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 434 states have (on average 1.6129032258064515) internal successors, (700), 455 states have internal predecessors, (700), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (86), 82 states have call predecessors, (86), 84 states have call successors, (86) [2024-11-19 21:47:38,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 875 transitions. [2024-11-19 21:47:38,636 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 875 transitions. Word has length 77 [2024-11-19 21:47:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:38,636 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 875 transitions. [2024-11-19 21:47:38,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 21:47:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 875 transitions. [2024-11-19 21:47:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 21:47:38,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:38,638 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 21:47:38,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 21:47:38,639 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:38,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:38,639 INFO L85 PathProgramCache]: Analyzing trace with hash 129943741, now seen corresponding path program 1 times [2024-11-19 21:47:38,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:38,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564418031] [2024-11-19 21:47:38,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:38,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:39,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:47:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:39,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:39,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:39,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:47:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:39,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 21:47:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:47:39,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:39,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564418031] [2024-11-19 21:47:39,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564418031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:39,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:39,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:47:39,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351865971] [2024-11-19 21:47:39,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:39,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:47:39,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:39,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:47:39,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:47:39,163 INFO L87 Difference]: Start difference. First operand 547 states and 875 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)