./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_product29.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 bf5a3f22f9d7a0aaa2c9864b464fdc1b701547a697c01ddf6ee0cf69e3554ef9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:55:14,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:55:14,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:55:14,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:55:14,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:55:14,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:55:14,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:55:14,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:55:14,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:55:14,502 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:55:14,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:55:14,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:55:14,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:55:14,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:55:14,503 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:55:14,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:55:14,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:55:14,504 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:55:14,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:55:14,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:55:14,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:55:14,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:55:14,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:55:14,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:55:14,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:55:14,508 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:55:14,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:55:14,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:55:14,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:55:14,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:55:14,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:55:14,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:55:14,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:55:14,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:55:14,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:55:14,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:55:14,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:55:14,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:55:14,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:55:14,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:55:14,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:55:14,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:55:14,511 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 -> bf5a3f22f9d7a0aaa2c9864b464fdc1b701547a697c01ddf6ee0cf69e3554ef9 [2024-11-08 14:55:14,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:55:14,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:55:14,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:55:14,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:55:14,759 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:55:14,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c [2024-11-08 14:55:15,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:55:16,186 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:55:16,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c [2024-11-08 14:55:16,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19aebe18a/3b4fce62ebe4493f83e54081c9033699/FLAGaf9fbc757 [2024-11-08 14:55:16,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19aebe18a/3b4fce62ebe4493f83e54081c9033699 [2024-11-08 14:55:16,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:55:16,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:55:16,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:55:16,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:55:16,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:55:16,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:55:16" (1/1) ... [2024-11-08 14:55:16,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a310b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:55:16, skipping insertion in model container [2024-11-08 14:55:16,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:55:16" (1/1) ... [2024-11-08 14:55:16,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:55:16,429 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_product29.cil.c[1700,1713] [2024-11-08 14:55:16,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:55:16,686 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:55:16,693 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2024-11-08 14:55:16,695 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [62] [2024-11-08 14:55:16,695 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [71] [2024-11-08 14:55:16,695 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [235] [2024-11-08 14:55:16,695 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [903] [2024-11-08 14:55:16,696 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1263] [2024-11-08 14:55:16,696 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1355] [2024-11-08 14:55:16,696 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1390] [2024-11-08 14:55:16,696 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1756] [2024-11-08 14:55:16,696 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3289] [2024-11-08 14:55:16,702 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_product29.cil.c[1700,1713] [2024-11-08 14:55:16,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:55:16,798 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:55:16,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:55:16 WrapperNode [2024-11-08 14:55:16,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:55:16,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:55:16,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:55:16,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:55:16,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:55:16" (1/1) ... [2024-11-08 14:55:16,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:55:16" (1/1) ... [2024-11-08 14:55:16,866 INFO L138 Inliner]: procedures = 93, calls = 338, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 863 [2024-11-08 14:55:16,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:55:16,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:55:16,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:55:16,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:55:16,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:55:16" (1/1) ... [2024-11-08 14:55:16,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:55:16" (1/1) ... [2024-11-08 14:55:16,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:55:16" (1/1) ... [2024-11-08 14:55:16,905 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-08 14:55:16,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:55:16" (1/1) ... [2024-11-08 14:55:16,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:55:16" (1/1) ... [2024-11-08 14:55:16,921 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:55:16" (1/1) ... [2024-11-08 14:55:16,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:55:16" (1/1) ... [2024-11-08 14:55:16,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:55:16" (1/1) ... [2024-11-08 14:55:16,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:55:16" (1/1) ... [2024-11-08 14:55:16,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:55:16,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:55:16,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:55:16,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:55:16,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:55:16" (1/1) ... [2024-11-08 14:55:16,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:55:16,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:55:16,982 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-08 14:55:16,984 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-08 14:55:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:55:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-08 14:55:17,043 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-08 14:55:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-08 14:55:17,043 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-08 14:55:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-08 14:55:17,043 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-08 14:55:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-08 14:55:17,044 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-08 14:55:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-08 14:55:17,044 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-08 14:55:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-11-08 14:55:17,044 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-11-08 14:55:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-08 14:55:17,044 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-08 14:55:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-08 14:55:17,044 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-08 14:55:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-08 14:55:17,044 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-08 14:55:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-08 14:55:17,044 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-08 14:55:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-08 14:55:17,045 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-08 14:55:17,045 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-08 14:55:17,045 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-08 14:55:17,045 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-11-08 14:55:17,045 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-11-08 14:55:17,045 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-08 14:55:17,046 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-08 14:55:17,046 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-08 14:55:17,046 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-08 14:55:17,046 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-08 14:55:17,046 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-08 14:55:17,046 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-08 14:55:17,046 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-08 14:55:17,050 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-08 14:55:17,050 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-08 14:55:17,050 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-11-08 14:55:17,050 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-11-08 14:55:17,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:55:17,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 14:55:17,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-08 14:55:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-08 14:55:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-11-08 14:55:17,052 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-11-08 14:55:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-08 14:55:17,052 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-08 14:55:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-08 14:55:17,052 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-08 14:55:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-08 14:55:17,052 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-08 14:55:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:55:17,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:55:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-08 14:55:17,052 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-08 14:55:17,216 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:55:17,219 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:55:18,115 INFO L? ?]: Removed 454 outVars from TransFormulas that were not future-live. [2024-11-08 14:55:18,116 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:55:18,138 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:55:18,140 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 14:55:18,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:55:18 BoogieIcfgContainer [2024-11-08 14:55:18,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:55:18,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:55:18,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:55:18,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:55:18,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:55:16" (1/3) ... [2024-11-08 14:55:18,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da14b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:55:18, skipping insertion in model container [2024-11-08 14:55:18,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:55:16" (2/3) ... [2024-11-08 14:55:18,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da14b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:55:18, skipping insertion in model container [2024-11-08 14:55:18,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:55:18" (3/3) ... [2024-11-08 14:55:18,147 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product29.cil.c [2024-11-08 14:55:18,159 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:55:18,159 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:55:18,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:55:18,227 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;@290088c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:55:18,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:55:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 563 states, 445 states have (on average 1.698876404494382) internal successors, (756), 466 states have internal predecessors, (756), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-08 14:55:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 14:55:18,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:55:18,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:55:18,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:55:18,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:55:18,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1610874664, now seen corresponding path program 1 times [2024-11-08 14:55:18,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:55:18,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662628950] [2024-11-08 14:55:18,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:55:18,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:55:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:18,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:55:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:18,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:18,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:55:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:19,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 14:55:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:19,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:19,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:55:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:19,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 14:55:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:19,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:55:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:19,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 14:55:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:19,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 14:55:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:19,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 14:55:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:19,389 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-08 14:55:19,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:55:19,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662628950] [2024-11-08 14:55:19,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662628950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:55:19,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:55:19,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:55:19,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987217849] [2024-11-08 14:55:19,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:55:19,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:55:19,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:55:19,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:55:19,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:55:19,423 INFO L87 Difference]: Start difference. First operand has 563 states, 445 states have (on average 1.698876404494382) internal successors, (756), 466 states have internal predecessors, (756), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-08 14:55:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:55:25,042 INFO L93 Difference]: Finished difference Result 1350 states and 2292 transitions. [2024-11-08 14:55:25,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 14:55:25,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2024-11-08 14:55:25,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:55:25,063 INFO L225 Difference]: With dead ends: 1350 [2024-11-08 14:55:25,063 INFO L226 Difference]: Without dead ends: 799 [2024-11-08 14:55:25,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-08 14:55:25,078 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 1435 mSDsluCounter, 2563 mSDsCounter, 0 mSdLazyCounter, 5350 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 5687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 5350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:55:25,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 3016 Invalid, 5687 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [337 Valid, 5350 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 14:55:25,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-08 14:55:25,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 558. [2024-11-08 14:55:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 442 states have (on average 1.6900452488687783) internal successors, (747), 461 states have internal predecessors, (747), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-08 14:55:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 926 transitions. [2024-11-08 14:55:25,271 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 926 transitions. Word has length 90 [2024-11-08 14:55:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:55:25,272 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 926 transitions. [2024-11-08 14:55:25,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-08 14:55:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 926 transitions. [2024-11-08 14:55:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 14:55:25,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:55:25,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:55:25,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 14:55:25,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:55:25,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:55:25,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1078497272, now seen corresponding path program 1 times [2024-11-08 14:55:25,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:55:25,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293669638] [2024-11-08 14:55:25,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:55:25,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:55:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:25,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:55:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:25,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:25,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:55:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:25,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 14:55:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:25,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:25,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:55:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:25,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:55:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:25,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:55:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:25,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:55:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:25,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:55:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:25,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:55:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:25,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 14:55:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:25,993 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-08 14:55:25,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:55:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293669638] [2024-11-08 14:55:25,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293669638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:55:25,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:55:25,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 14:55:25,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482896778] [2024-11-08 14:55:25,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:55:25,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 14:55:25,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:55:25,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 14:55:25,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:55:25,996 INFO L87 Difference]: Start difference. First operand 558 states and 926 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:55:32,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:55:32,368 INFO L93 Difference]: Finished difference Result 1348 states and 2273 transitions. [2024-11-08 14:55:32,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 14:55:32,369 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 96 [2024-11-08 14:55:32,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:55:32,375 INFO L225 Difference]: With dead ends: 1348 [2024-11-08 14:55:32,376 INFO L226 Difference]: Without dead ends: 808 [2024-11-08 14:55:32,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2024-11-08 14:55:32,380 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 994 mSDsluCounter, 3851 mSDsCounter, 0 mSdLazyCounter, 7863 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 4295 SdHoareTripleChecker+Invalid, 8069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 7863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:55:32,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 4295 Invalid, 8069 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [206 Valid, 7863 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 14:55:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-08 14:55:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 565. [2024-11-08 14:55:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 447 states have (on average 1.680089485458613) internal successors, (751), 466 states have internal predecessors, (751), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 87 states have call predecessors, (92), 87 states have call successors, (92) [2024-11-08 14:55:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 935 transitions. [2024-11-08 14:55:32,480 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 935 transitions. Word has length 96 [2024-11-08 14:55:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:55:32,481 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 935 transitions. [2024-11-08 14:55:32,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:55:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 935 transitions. [2024-11-08 14:55:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 14:55:32,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:55:32,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:55:32,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 14:55:32,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:55:32,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:55:32,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1811433455, now seen corresponding path program 1 times [2024-11-08 14:55:32,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:55:32,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207644294] [2024-11-08 14:55:32,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:55:32,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:55:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:32,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:55:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:32,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:32,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:55:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:32,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 14:55:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:32,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:32,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:55:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:32,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:55:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:32,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:55:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:32,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 14:55:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:32,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 14:55:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:32,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 14:55:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:32,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 14:55:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:32,968 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-08 14:55:32,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:55:32,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207644294] [2024-11-08 14:55:32,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207644294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:55:32,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:55:32,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:55:32,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418423253] [2024-11-08 14:55:32,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:55:32,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:55:32,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:55:32,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:55:32,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:55:32,972 INFO L87 Difference]: Start difference. First operand 565 states and 935 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:55:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:55:36,093 INFO L93 Difference]: Finished difference Result 1355 states and 2274 transitions. [2024-11-08 14:55:36,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 14:55:36,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-11-08 14:55:36,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:55:36,098 INFO L225 Difference]: With dead ends: 1355 [2024-11-08 14:55:36,098 INFO L226 Difference]: Without dead ends: 808 [2024-11-08 14:55:36,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:55:36,101 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 1883 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 2746 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 3222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 2746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 14:55:36,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1955 Valid, 1611 Invalid, 3222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 2746 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 14:55:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-08 14:55:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 565. [2024-11-08 14:55:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 447 states have (on average 1.6778523489932886) internal successors, (750), 466 states have internal predecessors, (750), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 87 states have call predecessors, (92), 87 states have call successors, (92) [2024-11-08 14:55:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 934 transitions. [2024-11-08 14:55:36,188 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 934 transitions. Word has length 98 [2024-11-08 14:55:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:55:36,188 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 934 transitions. [2024-11-08 14:55:36,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:55:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 934 transitions. [2024-11-08 14:55:36,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 14:55:36,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:55:36,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:55:36,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 14:55:36,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:55:36,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:55:36,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1526586216, now seen corresponding path program 1 times [2024-11-08 14:55:36,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:55:36,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28552252] [2024-11-08 14:55:36,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:55:36,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:55:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:36,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:55:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:36,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:36,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 14:55:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:36,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 14:55:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:36,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:36,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:55:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:36,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:55:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:36,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:55:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:36,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 14:55:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:36,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 14:55:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:36,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 14:55:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:36,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 14:55:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:36,678 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-08 14:55:36,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:55:36,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28552252] [2024-11-08 14:55:36,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28552252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:55:36,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:55:36,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:55:36,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717999529] [2024-11-08 14:55:36,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:55:36,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:55:36,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:55:36,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:55:36,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:55:36,680 INFO L87 Difference]: Start difference. First operand 565 states and 934 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:55:39,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:55:39,862 INFO L93 Difference]: Finished difference Result 1355 states and 2273 transitions. [2024-11-08 14:55:39,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 14:55:39,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-11-08 14:55:39,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:55:39,867 INFO L225 Difference]: With dead ends: 1355 [2024-11-08 14:55:39,867 INFO L226 Difference]: Without dead ends: 808 [2024-11-08 14:55:39,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:55:39,870 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 1435 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 2774 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 2774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 14:55:39,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1648 Invalid, 3120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 2774 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 14:55:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-08 14:55:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 565. [2024-11-08 14:55:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 447 states have (on average 1.6756152125279642) internal successors, (749), 466 states have internal predecessors, (749), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 87 states have call predecessors, (92), 87 states have call successors, (92) [2024-11-08 14:55:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 933 transitions. [2024-11-08 14:55:39,965 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 933 transitions. Word has length 99 [2024-11-08 14:55:39,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:55:39,965 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 933 transitions. [2024-11-08 14:55:39,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:55:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 933 transitions. [2024-11-08 14:55:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 14:55:39,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:55:39,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:55:39,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 14:55:39,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:55:39,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:55:39,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1389275509, now seen corresponding path program 1 times [2024-11-08 14:55:39,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:55:39,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7918367] [2024-11-08 14:55:39,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:55:39,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:55:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:40,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:55:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:40,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:40,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 14:55:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:40,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 14:55:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:40,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:40,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:55:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:40,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:55:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:40,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:55:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:40,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 14:55:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:40,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 14:55:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:40,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 14:55:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:40,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 14:55:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:40,399 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-08 14:55:40,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:55:40,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7918367] [2024-11-08 14:55:40,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7918367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:55:40,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:55:40,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:55:40,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169999166] [2024-11-08 14:55:40,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:55:40,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:55:40,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:55:40,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:55:40,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:55:40,401 INFO L87 Difference]: Start difference. First operand 565 states and 933 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:55:43,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:55:43,462 INFO L93 Difference]: Finished difference Result 1355 states and 2272 transitions. [2024-11-08 14:55:43,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 14:55:43,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-08 14:55:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:55:43,466 INFO L225 Difference]: With dead ends: 1355 [2024-11-08 14:55:43,466 INFO L226 Difference]: Without dead ends: 808 [2024-11-08 14:55:43,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:55:43,469 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 1881 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 2741 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1953 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 3223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 2741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:55:43,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1953 Valid, 1600 Invalid, 3223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 2741 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 14:55:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-08 14:55:43,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 565. [2024-11-08 14:55:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 447 states have (on average 1.6733780760626398) internal successors, (748), 466 states have internal predecessors, (748), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 87 states have call predecessors, (92), 87 states have call successors, (92) [2024-11-08 14:55:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 932 transitions. [2024-11-08 14:55:43,544 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 932 transitions. Word has length 100 [2024-11-08 14:55:43,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:55:43,544 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 932 transitions. [2024-11-08 14:55:43,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:55:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 932 transitions. [2024-11-08 14:55:43,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 14:55:43,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:55:43,547 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, 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-08 14:55:43,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 14:55:43,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:55:43,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:55:43,548 INFO L85 PathProgramCache]: Analyzing trace with hash -890905484, now seen corresponding path program 1 times [2024-11-08 14:55:43,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:55:43,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151855461] [2024-11-08 14:55:43,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:55:43,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:55:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:43,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:55:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:43,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:43,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:55:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:43,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:55:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:44,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:44,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:55:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:44,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:55:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:44,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:55:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:44,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 14:55:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:44,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 14:55:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:44,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 14:55:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:44,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 14:55:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:44,172 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-08 14:55:44,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:55:44,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151855461] [2024-11-08 14:55:44,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151855461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:55:44,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:55:44,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 14:55:44,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768747808] [2024-11-08 14:55:44,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:55:44,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 14:55:44,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:55:44,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 14:55:44,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-08 14:55:44,173 INFO L87 Difference]: Start difference. First operand 565 states and 932 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:55:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:55:49,603 INFO L93 Difference]: Finished difference Result 1334 states and 2231 transitions. [2024-11-08 14:55:49,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 14:55:49,604 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2024-11-08 14:55:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:55:49,610 INFO L225 Difference]: With dead ends: 1334 [2024-11-08 14:55:49,610 INFO L226 Difference]: Without dead ends: 827 [2024-11-08 14:55:49,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-11-08 14:55:49,612 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 1046 mSDsluCounter, 3428 mSDsCounter, 0 mSdLazyCounter, 6972 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 3871 SdHoareTripleChecker+Invalid, 7186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 6972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-08 14:55:49,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 3871 Invalid, 7186 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [214 Valid, 6972 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-08 14:55:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-11-08 14:55:49,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 566. [2024-11-08 14:55:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 448 states have (on average 1.6607142857142858) internal successors, (744), 466 states have internal predecessors, (744), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 88 states have call predecessors, (92), 87 states have call successors, (92) [2024-11-08 14:55:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 928 transitions. [2024-11-08 14:55:49,715 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 928 transitions. Word has length 101 [2024-11-08 14:55:49,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:55:49,715 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 928 transitions. [2024-11-08 14:55:49,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:55:49,716 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 928 transitions. [2024-11-08 14:55:49,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 14:55:49,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:55:49,718 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, 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-08 14:55:49,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 14:55:49,718 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:55:49,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:55:49,718 INFO L85 PathProgramCache]: Analyzing trace with hash 251640511, now seen corresponding path program 1 times [2024-11-08 14:55:49,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:55:49,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923360600] [2024-11-08 14:55:49,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:55:49,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:55:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:49,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:55:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:49,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:49,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:55:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:50,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 14:55:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:50,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:50,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:55:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:50,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:55:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:50,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:55:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:50,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 14:55:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:50,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 14:55:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:50,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 14:55:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:50,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 14:55:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:50,290 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-08 14:55:50,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:55:50,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923360600] [2024-11-08 14:55:50,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923360600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:55:50,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:55:50,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 14:55:50,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610142948] [2024-11-08 14:55:50,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:55:50,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 14:55:50,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:55:50,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 14:55:50,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 14:55:50,293 INFO L87 Difference]: Start difference. First operand 566 states and 928 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:55:53,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:55:53,933 INFO L93 Difference]: Finished difference Result 1339 states and 2240 transitions. [2024-11-08 14:55:53,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 14:55:53,934 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2024-11-08 14:55:53,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:55:53,937 INFO L225 Difference]: With dead ends: 1339 [2024-11-08 14:55:53,937 INFO L226 Difference]: Without dead ends: 831 [2024-11-08 14:55:53,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-08 14:55:53,940 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 1524 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 4302 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 2494 SdHoareTripleChecker+Invalid, 4672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 4302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 14:55:53,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1598 Valid, 2494 Invalid, 4672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 4302 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 14:55:53,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2024-11-08 14:55:54,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 569. [2024-11-08 14:55:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 451 states have (on average 1.647450110864745) internal successors, (743), 469 states have internal predecessors, (743), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 88 states have call predecessors, (92), 87 states have call successors, (92) [2024-11-08 14:55:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 927 transitions. [2024-11-08 14:55:54,017 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 927 transitions. Word has length 102 [2024-11-08 14:55:54,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:55:54,018 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 927 transitions. [2024-11-08 14:55:54,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:55:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 927 transitions. [2024-11-08 14:55:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 14:55:54,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:55:54,020 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, 1, 1, 1, 1, 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-08 14:55:54,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 14:55:54,020 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:55:54,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:55:54,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1057939171, now seen corresponding path program 1 times [2024-11-08 14:55:54,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:55:54,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368885339] [2024-11-08 14:55:54,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:55:54,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:55:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:54,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:55:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:54,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:54,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:55:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:54,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 14:55:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:54,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:54,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:55:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:54,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:55:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:54,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:55:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:54,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:55:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:54,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:55:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:54,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 14:55:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:54,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 14:55:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:54,547 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-08 14:55:54,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:55:54,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368885339] [2024-11-08 14:55:54,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368885339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:55:54,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:55:54,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:55:54,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364022979] [2024-11-08 14:55:54,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:55:54,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:55:54,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:55:54,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:55:54,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:55:54,549 INFO L87 Difference]: Start difference. First operand 569 states and 927 transitions. Second operand has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 14:55:58,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:55:58,884 INFO L93 Difference]: Finished difference Result 1340 states and 2222 transitions. [2024-11-08 14:55:58,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 14:55:58,885 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2024-11-08 14:55:58,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:55:58,889 INFO L225 Difference]: With dead ends: 1340 [2024-11-08 14:55:58,889 INFO L226 Difference]: Without dead ends: 838 [2024-11-08 14:55:58,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-08 14:55:58,893 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 1956 mSDsluCounter, 2461 mSDsCounter, 0 mSdLazyCounter, 5106 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2029 SdHoareTripleChecker+Valid, 2909 SdHoareTripleChecker+Invalid, 5590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 5106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 14:55:58,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2029 Valid, 2909 Invalid, 5590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 5106 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 14:55:58,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-08 14:55:58,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 582. [2024-11-08 14:55:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 461 states have (on average 1.6442516268980478) internal successors, (758), 481 states have internal predecessors, (758), 93 states have call successors, (93), 24 states have call predecessors, (93), 27 states have return successors, (95), 89 states have call predecessors, (95), 88 states have call successors, (95) [2024-11-08 14:55:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 946 transitions. [2024-11-08 14:55:58,982 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 946 transitions. Word has length 106 [2024-11-08 14:55:58,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:55:58,982 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 946 transitions. [2024-11-08 14:55:58,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 14:55:58,982 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 946 transitions. [2024-11-08 14:55:58,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 14:55:58,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:55:58,985 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, 1, 1, 1, 1, 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-08 14:55:58,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 14:55:58,985 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:55:58,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:55:58,986 INFO L85 PathProgramCache]: Analyzing trace with hash 672572388, now seen corresponding path program 1 times [2024-11-08 14:55:58,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:55:58,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057999327] [2024-11-08 14:55:58,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:55:58,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:55:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:59,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:55:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:59,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:59,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:55:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:59,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 14:55:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:59,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:55:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:59,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:55:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:59,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:55:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:59,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:55:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:59,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:55:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:59,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:55:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:59,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 14:55:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:59,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 14:55:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 14:55:59,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:55:59,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057999327] [2024-11-08 14:55:59,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057999327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:55:59,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079235656] [2024-11-08 14:55:59,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:55:59,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:55:59,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:55:59,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:55:59,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 14:55:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:55:59,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 14:55:59,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:55:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:55:59,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:55:59,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079235656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:55:59,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:55:59,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 14 [2024-11-08 14:55:59,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80226530] [2024-11-08 14:55:59,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:55:59,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 14:55:59,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:55:59,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 14:55:59,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-08 14:55:59,763 INFO L87 Difference]: Start difference. First operand 582 states and 946 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:56:00,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:56:00,001 INFO L93 Difference]: Finished difference Result 1534 states and 2557 transitions. [2024-11-08 14:56:00,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 14:56:00,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2024-11-08 14:56:00,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:56:00,011 INFO L225 Difference]: With dead ends: 1534 [2024-11-08 14:56:00,011 INFO L226 Difference]: Without dead ends: 1037 [2024-11-08 14:56:00,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-08 14:56:00,016 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 840 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:56:00,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1695 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:56:00,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2024-11-08 14:56:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1022. [2024-11-08 14:56:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 805 states have (on average 1.631055900621118) internal successors, (1313), 838 states have internal predecessors, (1313), 168 states have call successors, (168), 43 states have call predecessors, (168), 48 states have return successors, (194), 166 states have call predecessors, (194), 163 states have call successors, (194) [2024-11-08 14:56:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1675 transitions. [2024-11-08 14:56:00,188 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1675 transitions. Word has length 106 [2024-11-08 14:56:00,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:56:00,189 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1675 transitions. [2024-11-08 14:56:00,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:56:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1675 transitions. [2024-11-08 14:56:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 14:56:00,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:56:00,191 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, 1, 1, 1, 1, 1, 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-08 14:56:00,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 14:56:00,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:56:00,392 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:56:00,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:56:00,393 INFO L85 PathProgramCache]: Analyzing trace with hash -167015540, now seen corresponding path program 1 times [2024-11-08 14:56:00,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:56:00,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919267852] [2024-11-08 14:56:00,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:56:00,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:56:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:00,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:56:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:00,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:00,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:56:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:00,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 14:56:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:00,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:00,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:56:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:00,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:56:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:00,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:56:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:00,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:56:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:00,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 14:56:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:00,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 14:56:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:00,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 14:56:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:00,830 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-08 14:56:00,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:56:00,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919267852] [2024-11-08 14:56:00,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919267852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:56:00,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:56:00,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:56:00,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587394178] [2024-11-08 14:56:00,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:56:00,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:56:00,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:56:00,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:56:00,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:56:00,831 INFO L87 Difference]: Start difference. First operand 1022 states and 1675 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:56:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:56:03,849 INFO L93 Difference]: Finished difference Result 2406 states and 4028 transitions. [2024-11-08 14:56:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:56:03,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2024-11-08 14:56:03,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:56:03,857 INFO L225 Difference]: With dead ends: 2406 [2024-11-08 14:56:03,857 INFO L226 Difference]: Without dead ends: 1446 [2024-11-08 14:56:03,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:56:03,860 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 1953 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2025 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 2667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:56:03,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2025 Valid, 1592 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 2667 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 14:56:03,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2024-11-08 14:56:04,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1064. [2024-11-08 14:56:04,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 841 states have (on average 1.6266349583828774) internal successors, (1368), 874 states have internal predecessors, (1368), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-11-08 14:56:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1741 transitions. [2024-11-08 14:56:04,044 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1741 transitions. Word has length 107 [2024-11-08 14:56:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:56:04,044 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1741 transitions. [2024-11-08 14:56:04,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:56:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1741 transitions. [2024-11-08 14:56:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 14:56:04,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:56:04,047 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, 1, 1, 1, 1, 1, 1, 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-08 14:56:04,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 14:56:04,047 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:56:04,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:56:04,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1427762777, now seen corresponding path program 1 times [2024-11-08 14:56:04,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:56:04,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408827671] [2024-11-08 14:56:04,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:56:04,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:56:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:04,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:56:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:04,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:04,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:56:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:04,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 14:56:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:04,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:04,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:56:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:04,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:56:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:04,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:56:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:04,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:56:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:04,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 14:56:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:04,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 14:56:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:04,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 14:56:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:04,509 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-08 14:56:04,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:56:04,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408827671] [2024-11-08 14:56:04,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408827671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:56:04,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:56:04,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:56:04,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507991989] [2024-11-08 14:56:04,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:56:04,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:56:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:56:04,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:56:04,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:56:04,511 INFO L87 Difference]: Start difference. First operand 1064 states and 1741 transitions. Second operand has 10 states, 9 states have (on average 9.0) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 14:56:08,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:56:08,802 INFO L93 Difference]: Finished difference Result 2425 states and 4054 transitions. [2024-11-08 14:56:08,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 14:56:08,803 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.0) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-08 14:56:08,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:56:08,810 INFO L225 Difference]: With dead ends: 2425 [2024-11-08 14:56:08,810 INFO L226 Difference]: Without dead ends: 1438 [2024-11-08 14:56:08,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-08 14:56:08,813 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 1907 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 5043 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1980 SdHoareTripleChecker+Valid, 2915 SdHoareTripleChecker+Invalid, 5524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 5043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 14:56:08,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1980 Valid, 2915 Invalid, 5524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 5043 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 14:56:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2024-11-08 14:56:08,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1064. [2024-11-08 14:56:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 841 states have (on average 1.6254458977407849) internal successors, (1367), 874 states have internal predecessors, (1367), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-11-08 14:56:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1740 transitions. [2024-11-08 14:56:09,005 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1740 transitions. Word has length 108 [2024-11-08 14:56:09,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:56:09,005 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1740 transitions. [2024-11-08 14:56:09,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.0) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 14:56:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1740 transitions. [2024-11-08 14:56:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 14:56:09,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:56:09,008 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, 1, 1, 1, 1, 1, 1, 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-08 14:56:09,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 14:56:09,008 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:56:09,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:56:09,008 INFO L85 PathProgramCache]: Analyzing trace with hash -665957063, now seen corresponding path program 1 times [2024-11-08 14:56:09,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:56:09,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940895628] [2024-11-08 14:56:09,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:56:09,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:56:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:09,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:56:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:09,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:09,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:56:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:09,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 14:56:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:09,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:09,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:56:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:09,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:56:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:09,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:56:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:09,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:56:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:09,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 14:56:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:09,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 14:56:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:09,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 14:56:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:09,398 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-08 14:56:09,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:56:09,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940895628] [2024-11-08 14:56:09,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940895628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:56:09,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:56:09,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:56:09,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270729021] [2024-11-08 14:56:09,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:56:09,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:56:09,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:56:09,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:56:09,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:56:09,400 INFO L87 Difference]: Start difference. First operand 1064 states and 1740 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:56:12,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:56:12,395 INFO L93 Difference]: Finished difference Result 2448 states and 4090 transitions. [2024-11-08 14:56:12,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:56:12,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-11-08 14:56:12,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:56:12,402 INFO L225 Difference]: With dead ends: 2448 [2024-11-08 14:56:12,402 INFO L226 Difference]: Without dead ends: 1446 [2024-11-08 14:56:12,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:56:12,405 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 1492 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 2711 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 3052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 2711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:56:12,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 1662 Invalid, 3052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 2711 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 14:56:12,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2024-11-08 14:56:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1064. [2024-11-08 14:56:12,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 841 states have (on average 1.6195005945303211) internal successors, (1362), 874 states have internal predecessors, (1362), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-11-08 14:56:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1735 transitions. [2024-11-08 14:56:12,701 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1735 transitions. Word has length 108 [2024-11-08 14:56:12,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:56:12,701 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1735 transitions. [2024-11-08 14:56:12,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:56:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1735 transitions. [2024-11-08 14:56:12,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 14:56:12,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:56:12,703 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, 1, 1, 1, 1, 1, 1, 1, 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-08 14:56:12,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 14:56:12,703 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:56:12,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:56:12,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1551503601, now seen corresponding path program 1 times [2024-11-08 14:56:12,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:56:12,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159104817] [2024-11-08 14:56:12,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:56:12,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:56:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:12,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:56:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:12,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:12,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:56:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:13,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:56:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:13,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:13,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:56:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:13,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:56:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:13,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:56:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:13,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:56:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:13,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 14:56:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:13,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 14:56:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:13,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 14:56:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:13,130 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-08 14:56:13,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:56:13,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159104817] [2024-11-08 14:56:13,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159104817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:56:13,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:56:13,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:56:13,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019245836] [2024-11-08 14:56:13,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:56:13,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:56:13,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:56:13,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:56:13,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:56:13,131 INFO L87 Difference]: Start difference. First operand 1064 states and 1735 transitions. Second operand has 10 states, 9 states have (on average 9.11111111111111) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 14:56:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:56:17,647 INFO L93 Difference]: Finished difference Result 2434 states and 4058 transitions. [2024-11-08 14:56:17,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 14:56:17,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.11111111111111) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2024-11-08 14:56:17,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:56:17,653 INFO L225 Difference]: With dead ends: 2434 [2024-11-08 14:56:17,653 INFO L226 Difference]: Without dead ends: 1444 [2024-11-08 14:56:17,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-08 14:56:17,656 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 998 mSDsluCounter, 2581 mSDsCounter, 0 mSdLazyCounter, 5179 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 3030 SdHoareTripleChecker+Invalid, 5381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 5179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:56:17,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 3030 Invalid, 5381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 5179 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 14:56:17,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2024-11-08 14:56:17,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1067. [2024-11-08 14:56:17,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 844 states have (on average 1.6161137440758293) internal successors, (1364), 877 states have internal predecessors, (1364), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-11-08 14:56:17,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1737 transitions. [2024-11-08 14:56:17,837 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1737 transitions. Word has length 109 [2024-11-08 14:56:17,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:56:17,837 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1737 transitions. [2024-11-08 14:56:17,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.11111111111111) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 14:56:17,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1737 transitions. [2024-11-08 14:56:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 14:56:17,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:56:17,840 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, 1, 1, 1, 1, 1, 1, 1, 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-08 14:56:17,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 14:56:17,840 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:56:17,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:56:17,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1597870287, now seen corresponding path program 1 times [2024-11-08 14:56:17,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:56:17,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241997074] [2024-11-08 14:56:17,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:56:17,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:56:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:17,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:56:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:17,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:17,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:56:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:18,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:56:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:18,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:18,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:56:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:18,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:56:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:18,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:56:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:18,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:56:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:18,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 14:56:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:18,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 14:56:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:18,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 14:56:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:18,221 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-08 14:56:18,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:56:18,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241997074] [2024-11-08 14:56:18,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241997074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:56:18,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:56:18,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:56:18,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621468071] [2024-11-08 14:56:18,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:56:18,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:56:18,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:56:18,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:56:18,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:56:18,223 INFO L87 Difference]: Start difference. First operand 1067 states and 1737 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:56:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:56:21,268 INFO L93 Difference]: Finished difference Result 2457 states and 4090 transitions. [2024-11-08 14:56:21,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:56:21,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-08 14:56:21,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:56:21,275 INFO L225 Difference]: With dead ends: 2457 [2024-11-08 14:56:21,275 INFO L226 Difference]: Without dead ends: 1452 [2024-11-08 14:56:21,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:56:21,279 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 1950 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2022 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 3105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 497 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:56:21,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2022 Valid, 1592 Invalid, 3105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [497 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 14:56:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2024-11-08 14:56:21,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1067. [2024-11-08 14:56:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 844 states have (on average 1.6101895734597156) internal successors, (1359), 877 states have internal predecessors, (1359), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-11-08 14:56:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1732 transitions. [2024-11-08 14:56:21,541 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1732 transitions. Word has length 109 [2024-11-08 14:56:21,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:56:21,541 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1732 transitions. [2024-11-08 14:56:21,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:56:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1732 transitions. [2024-11-08 14:56:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 14:56:21,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:56:21,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:56:21,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 14:56:21,544 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:56:21,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:56:21,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1181118558, now seen corresponding path program 1 times [2024-11-08 14:56:21,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:56:21,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062053151] [2024-11-08 14:56:21,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:56:21,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:56:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:21,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:56:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:21,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:21,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:56:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:21,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 14:56:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:21,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:21,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:56:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:21,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:56:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:21,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:56:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:22,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:56:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:22,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 14:56:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:22,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 14:56:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:22,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 14:56:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:22,016 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-08 14:56:22,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:56:22,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062053151] [2024-11-08 14:56:22,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062053151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:56:22,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:56:22,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:56:22,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992765001] [2024-11-08 14:56:22,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:56:22,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:56:22,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:56:22,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:56:22,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:56:22,018 INFO L87 Difference]: Start difference. First operand 1067 states and 1732 transitions. Second operand has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 14:56:26,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:56:26,445 INFO L93 Difference]: Finished difference Result 2442 states and 4059 transitions. [2024-11-08 14:56:26,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 14:56:26,446 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2024-11-08 14:56:26,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:56:26,453 INFO L225 Difference]: With dead ends: 2442 [2024-11-08 14:56:26,453 INFO L226 Difference]: Without dead ends: 1452 [2024-11-08 14:56:26,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-08 14:56:26,456 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 987 mSDsluCounter, 2581 mSDsCounter, 0 mSdLazyCounter, 5131 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 3030 SdHoareTripleChecker+Invalid, 5336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 5131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:56:26,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 3030 Invalid, 5336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 5131 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 14:56:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2024-11-08 14:56:26,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1071. [2024-11-08 14:56:26,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 848 states have (on average 1.6061320754716981) internal successors, (1362), 881 states have internal predecessors, (1362), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-11-08 14:56:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1735 transitions. [2024-11-08 14:56:26,651 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1735 transitions. Word has length 110 [2024-11-08 14:56:26,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:56:26,652 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1735 transitions. [2024-11-08 14:56:26,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 14:56:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1735 transitions. [2024-11-08 14:56:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 14:56:26,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:56:26,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:56:26,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 14:56:26,654 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:56:26,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:56:26,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1227962942, now seen corresponding path program 1 times [2024-11-08 14:56:26,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:56:26,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622170514] [2024-11-08 14:56:26,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:56:26,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:56:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:26,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:56:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:26,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:26,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:56:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:27,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 14:56:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:27,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:27,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:56:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:27,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:56:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:27,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:56:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:27,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:56:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 14:56:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:27,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 14:56:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:27,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 14:56:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:27,057 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-08 14:56:27,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:56:27,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622170514] [2024-11-08 14:56:27,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622170514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:56:27,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:56:27,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:56:27,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100861528] [2024-11-08 14:56:27,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:56:27,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:56:27,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:56:27,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:56:27,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:56:27,060 INFO L87 Difference]: Start difference. First operand 1071 states and 1735 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:56:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:56:30,447 INFO L93 Difference]: Finished difference Result 2493 states and 4118 transitions. [2024-11-08 14:56:30,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 14:56:30,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-11-08 14:56:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:56:30,454 INFO L225 Difference]: With dead ends: 2493 [2024-11-08 14:56:30,454 INFO L226 Difference]: Without dead ends: 1420 [2024-11-08 14:56:30,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:56:30,457 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 942 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 2811 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 3014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 2811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 14:56:30,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 1701 Invalid, 3014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 2811 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 14:56:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2024-11-08 14:56:30,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1052. [2024-11-08 14:56:30,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 832 states have (on average 1.6105769230769231) internal successors, (1340), 863 states have internal predecessors, (1340), 171 states have call successors, (171), 43 states have call predecessors, (171), 48 states have return successors, (198), 169 states have call predecessors, (198), 166 states have call successors, (198) [2024-11-08 14:56:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1709 transitions. [2024-11-08 14:56:30,671 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1709 transitions. Word has length 110 [2024-11-08 14:56:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:56:30,672 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1709 transitions. [2024-11-08 14:56:30,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 14:56:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1709 transitions. [2024-11-08 14:56:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 14:56:30,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:56:30,675 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:56:30,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 14:56:30,676 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:56:30,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:56:30,676 INFO L85 PathProgramCache]: Analyzing trace with hash 593658932, now seen corresponding path program 1 times [2024-11-08 14:56:30,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:56:30,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939074998] [2024-11-08 14:56:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:56:30,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:56:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:30,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:56:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:30,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:30,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:56:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:31,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 14:56:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:31,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:31,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:56:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:31,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:56:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:31,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:56:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:31,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:56:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:31,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 14:56:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:31,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 14:56:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:31,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 14:56:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:31,091 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-08 14:56:31,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:56:31,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939074998] [2024-11-08 14:56:31,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939074998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:56:31,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:56:31,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:56:31,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703537950] [2024-11-08 14:56:31,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:56:31,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:56:31,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:56:31,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:56:31,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:56:31,093 INFO L87 Difference]: Start difference. First operand 1052 states and 1709 transitions. Second operand has 10 states, 9 states have (on average 9.333333333333334) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 14:56:35,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:56:35,549 INFO L93 Difference]: Finished difference Result 2417 states and 4020 transitions. [2024-11-08 14:56:35,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 14:56:35,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.333333333333334) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2024-11-08 14:56:35,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:56:35,556 INFO L225 Difference]: With dead ends: 2417 [2024-11-08 14:56:35,556 INFO L226 Difference]: Without dead ends: 1430 [2024-11-08 14:56:35,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-08 14:56:35,559 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 966 mSDsluCounter, 2571 mSDsCounter, 0 mSdLazyCounter, 5048 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 5251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 5048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:56:35,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 3016 Invalid, 5251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 5048 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 14:56:35,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-11-08 14:56:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1057. [2024-11-08 14:56:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 837 states have (on average 1.6069295101553167) internal successors, (1345), 868 states have internal predecessors, (1345), 171 states have call successors, (171), 43 states have call predecessors, (171), 48 states have return successors, (198), 169 states have call predecessors, (198), 166 states have call successors, (198) [2024-11-08 14:56:35,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1714 transitions. [2024-11-08 14:56:35,785 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1714 transitions. Word has length 111 [2024-11-08 14:56:35,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:56:35,785 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1714 transitions. [2024-11-08 14:56:35,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.333333333333334) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 14:56:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1714 transitions. [2024-11-08 14:56:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 14:56:35,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:56:35,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:56:35,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 14:56:35,787 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:56:35,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:56:35,788 INFO L85 PathProgramCache]: Analyzing trace with hash -328963981, now seen corresponding path program 1 times [2024-11-08 14:56:35,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:56:35,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795015548] [2024-11-08 14:56:35,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:56:35,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:56:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:35,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:56:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:35,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:35,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:56:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:36,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 14:56:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:36,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:56:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:36,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:56:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:36,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:56:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:36,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 14:56:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:36,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:56:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:36,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 14:56:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:36,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 14:56:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:36,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 14:56:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:56:36,264 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-08 14:56:36,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:56:36,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795015548] [2024-11-08 14:56:36,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795015548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:56:36,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:56:36,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 14:56:36,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15928116] [2024-11-08 14:56:36,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:56:36,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 14:56:36,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:56:36,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 14:56:36,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:56:36,266 INFO L87 Difference]: Start difference. First operand 1057 states and 1714 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12)