./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_product25.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 68864d90c2581c7e2b9a72172352bcf9279d03107788434bd4ac5af6cc5db51a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:33:35,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:33:35,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:33:35,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:33:35,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:33:35,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:33:35,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:33:35,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:33:35,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:33:35,830 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:33:35,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:33:35,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:33:35,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:33:35,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:33:35,835 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:33:35,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:33:35,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:33:35,836 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:33:35,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:33:35,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:33:35,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:33:35,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:33:35,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:33:35,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:33:35,842 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:33:35,842 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:33:35,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:33:35,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:33:35,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:33:35,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:33:35,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:33:35,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:33:35,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:33:35,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:33:35,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:33:35,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:33:35,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:33:35,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:33:35,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:33:35,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:33:35,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:33:35,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:33:35,848 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 -> 68864d90c2581c7e2b9a72172352bcf9279d03107788434bd4ac5af6cc5db51a [2024-11-11 20:33:36,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:33:36,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:33:36,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:33:36,121 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:33:36,124 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:33:36,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c [2024-11-11 20:33:37,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:33:37,880 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:33:37,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c [2024-11-11 20:33:37,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f793141de/d9f8b2f55f4743e2bbb0e023b10773c5/FLAG43313c561 [2024-11-11 20:33:38,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f793141de/d9f8b2f55f4743e2bbb0e023b10773c5 [2024-11-11 20:33:38,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:33:38,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:33:38,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:33:38,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:33:38,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:33:38,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:33:38" (1/1) ... [2024-11-11 20:33:38,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f362e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:38, skipping insertion in model container [2024-11-11 20:33:38,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:33:38" (1/1) ... [2024-11-11 20:33:38,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:33:38,635 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_product25.cil.c[23488,23501] [2024-11-11 20:33:38,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:33:38,799 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:33:38,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [48] [2024-11-11 20:33:38,811 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [213] [2024-11-11 20:33:38,811 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [334] [2024-11-11 20:33:38,811 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [432] [2024-11-11 20:33:38,812 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [446] [2024-11-11 20:33:38,812 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [812] [2024-11-11 20:33:38,812 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1166] [2024-11-11 20:33:38,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1175] [2024-11-11 20:33:38,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1842] [2024-11-11 20:33:38,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1877] [2024-11-11 20:33:38,867 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_product25.cil.c[23488,23501] [2024-11-11 20:33:38,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:33:38,950 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:33:38,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:38 WrapperNode [2024-11-11 20:33:38,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:33:38,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:33:38,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:33:38,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:33:38,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:38" (1/1) ... [2024-11-11 20:33:38,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:38" (1/1) ... [2024-11-11 20:33:39,020 INFO L138 Inliner]: procedures = 91, calls = 331, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 804 [2024-11-11 20:33:39,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:33:39,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:33:39,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:33:39,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:33:39,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:38" (1/1) ... [2024-11-11 20:33:39,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:38" (1/1) ... [2024-11-11 20:33:39,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:38" (1/1) ... [2024-11-11 20:33:39,076 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-11 20:33:39,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:38" (1/1) ... [2024-11-11 20:33:39,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:38" (1/1) ... [2024-11-11 20:33:39,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:38" (1/1) ... [2024-11-11 20:33:39,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:38" (1/1) ... [2024-11-11 20:33:39,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:38" (1/1) ... [2024-11-11 20:33:39,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:38" (1/1) ... [2024-11-11 20:33:39,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:33:39,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:33:39,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:33:39,144 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:33:39,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:38" (1/1) ... [2024-11-11 20:33:39,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:33:39,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:33:39,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:33:39,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:33:39,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:33:39,247 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-11 20:33:39,247 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-11 20:33:39,248 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-11 20:33:39,248 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-11 20:33:39,248 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-11 20:33:39,248 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-11 20:33:39,248 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-11 20:33:39,248 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-11 20:33:39,248 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-11 20:33:39,248 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-11 20:33:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:33:39,249 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:33:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:33:39,249 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:33:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-11 20:33:39,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-11 20:33:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-11 20:33:39,249 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-11 20:33:39,250 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-11 20:33:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-11 20:33:39,250 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-11 20:33:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-11 20:33:39,250 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-11 20:33:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-11 20:33:39,250 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-11 20:33:39,251 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-11 20:33:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-11 20:33:39,251 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-11 20:33:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-11 20:33:39,251 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-11 20:33:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-11 20:33:39,251 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-11 20:33:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-11-11 20:33:39,251 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-11-11 20:33:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:33:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:33:39,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:33:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:33:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-11 20:33:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-11 20:33:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-11 20:33:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-11 20:33:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-11 20:33:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-11 20:33:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-11 20:33:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-11 20:33:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-11 20:33:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-11 20:33:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-11 20:33:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-11 20:33:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-11 20:33:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-11 20:33:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-11 20:33:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-11 20:33:39,256 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-11 20:33:39,256 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-11 20:33:39,256 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-11 20:33:39,256 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-11 20:33:39,256 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-11 20:33:39,256 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-11 20:33:39,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:33:39,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:33:39,257 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-11 20:33:39,257 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-11 20:33:39,433 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:33:39,435 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:33:40,548 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2024-11-11 20:33:40,549 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:33:40,577 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:33:40,577 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:33:40,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:33:40 BoogieIcfgContainer [2024-11-11 20:33:40,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:33:40,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:33:40,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:33:40,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:33:40,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:33:38" (1/3) ... [2024-11-11 20:33:40,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb74178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:33:40, skipping insertion in model container [2024-11-11 20:33:40,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:38" (2/3) ... [2024-11-11 20:33:40,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb74178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:33:40, skipping insertion in model container [2024-11-11 20:33:40,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:33:40" (3/3) ... [2024-11-11 20:33:40,590 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product25.cil.c [2024-11-11 20:33:40,639 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:33:40,639 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:33:40,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:33:40,739 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;@3c026a29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:33:40,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:33:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 532 states, 424 states have (on average 1.7146226415094339) internal successors, (727), 445 states have internal predecessors, (727), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-11 20:33:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 20:33:40,774 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:33:40,775 INFO L218 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] [2024-11-11 20:33:40,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:33:40,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:33:40,780 INFO L85 PathProgramCache]: Analyzing trace with hash 190080560, now seen corresponding path program 1 times [2024-11-11 20:33:40,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:33:40,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105675252] [2024-11-11 20:33:40,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:33:40,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:33:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:41,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:33:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:41,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:41,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 20:33:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:33:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:33:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:33:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,368 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-11 20:33:42,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:33:42,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105675252] [2024-11-11 20:33:42,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105675252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:33:42,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:33:42,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:33:42,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322153464] [2024-11-11 20:33:42,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:33:42,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:33:42,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:33:42,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:33:42,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:33:42,407 INFO L87 Difference]: Start difference. First operand has 532 states, 424 states have (on average 1.7146226415094339) internal successors, (727), 445 states have internal predecessors, (727), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 20:33:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:33:49,329 INFO L93 Difference]: Finished difference Result 1289 states and 2209 transitions. [2024-11-11 20:33:49,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 20:33:49,332 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2024-11-11 20:33:49,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:33:49,363 INFO L225 Difference]: With dead ends: 1289 [2024-11-11 20:33:49,364 INFO L226 Difference]: Without dead ends: 769 [2024-11-11 20:33:49,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:33:49,385 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 1812 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 4945 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 2899 SdHoareTripleChecker+Invalid, 5404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 4945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:33:49,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1878 Valid, 2899 Invalid, 5404 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [459 Valid, 4945 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-11 20:33:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-11 20:33:49,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 528. [2024-11-11 20:33:49,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 421 states have (on average 1.7054631828978621) internal successors, (718), 440 states have internal predecessors, (718), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (82), 79 states have call predecessors, (82), 80 states have call successors, (82) [2024-11-11 20:33:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 885 transitions. [2024-11-11 20:33:49,686 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 885 transitions. Word has length 76 [2024-11-11 20:33:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:33:49,687 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 885 transitions. [2024-11-11 20:33:49,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 20:33:49,687 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 885 transitions. [2024-11-11 20:33:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-11 20:33:49,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:33:49,697 INFO L218 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] [2024-11-11 20:33:49,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:33:49,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:33:49,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:33:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1570486616, now seen corresponding path program 1 times [2024-11-11 20:33:49,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:33:49,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842711977] [2024-11-11 20:33:49,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:33:49,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:33:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:49,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:33:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:49,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:49,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:33:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:50,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:33:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:50,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:50,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:50,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:33:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:50,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:33:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:50,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:33:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:50,446 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-11 20:33:50,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:33:50,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842711977] [2024-11-11 20:33:50,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842711977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:33:50,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:33:50,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 20:33:50,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131730836] [2024-11-11 20:33:50,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:33:50,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:33:50,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:33:50,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:33:50,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:33:50,453 INFO L87 Difference]: Start difference. First operand 528 states and 885 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-11 20:34:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:02,441 INFO L93 Difference]: Finished difference Result 2412 states and 4257 transitions. [2024-11-11 20:34:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-11 20:34:02,442 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 83 [2024-11-11 20:34:02,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:02,463 INFO L225 Difference]: With dead ends: 2412 [2024-11-11 20:34:02,464 INFO L226 Difference]: Without dead ends: 1902 [2024-11-11 20:34:02,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2024-11-11 20:34:02,473 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 5055 mSDsluCounter, 3020 mSDsCounter, 0 mSdLazyCounter, 5655 mSolverCounterSat, 1545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5125 SdHoareTripleChecker+Valid, 3558 SdHoareTripleChecker+Invalid, 7200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1545 IncrementalHoareTripleChecker+Valid, 5655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:02,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5125 Valid, 3558 Invalid, 7200 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1545 Valid, 5655 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-11 20:34:02,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2024-11-11 20:34:02,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1369. [2024-11-11 20:34:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1085 states have (on average 1.6654377880184332) internal successors, (1807), 1132 states have internal predecessors, (1807), 224 states have call successors, (224), 56 states have call predecessors, (224), 59 states have return successors, (258), 216 states have call predecessors, (258), 219 states have call successors, (258) [2024-11-11 20:34:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2289 transitions. [2024-11-11 20:34:02,744 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2289 transitions. Word has length 83 [2024-11-11 20:34:02,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:02,744 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2289 transitions. [2024-11-11 20:34:02,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-11 20:34:02,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2289 transitions. [2024-11-11 20:34:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-11 20:34:02,748 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:02,748 INFO L218 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, 1, 1] [2024-11-11 20:34:02,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:34:02,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:02,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1455397564, now seen corresponding path program 1 times [2024-11-11 20:34:02,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:02,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881987446] [2024-11-11 20:34:02,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:02,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:02,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:03,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:03,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:34:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:03,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:34:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:03,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:03,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:03,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:34:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:03,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:34:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:03,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:34:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:03,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:34:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:03,591 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-11 20:34:03,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881987446] [2024-11-11 20:34:03,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881987446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:03,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:03,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:34:03,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093192537] [2024-11-11 20:34:03,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:03,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:34:03,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:03,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:34:03,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:34:03,594 INFO L87 Difference]: Start difference. First operand 1369 states and 2289 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:34:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:13,007 INFO L93 Difference]: Finished difference Result 3331 states and 5684 transitions. [2024-11-11 20:34:13,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 20:34:13,007 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2024-11-11 20:34:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:13,025 INFO L225 Difference]: With dead ends: 3331 [2024-11-11 20:34:13,026 INFO L226 Difference]: Without dead ends: 1978 [2024-11-11 20:34:13,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-11-11 20:34:13,036 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 3701 mSDsluCounter, 3051 mSDsCounter, 0 mSdLazyCounter, 6643 mSolverCounterSat, 1017 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3767 SdHoareTripleChecker+Valid, 3497 SdHoareTripleChecker+Invalid, 7660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1017 IncrementalHoareTripleChecker+Valid, 6643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:13,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3767 Valid, 3497 Invalid, 7660 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1017 Valid, 6643 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-11 20:34:13,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2024-11-11 20:34:13,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1446. [2024-11-11 20:34:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1145 states have (on average 1.6524017467248908) internal successors, (1892), 1194 states have internal predecessors, (1892), 236 states have call successors, (236), 61 states have call predecessors, (236), 64 states have return successors, (279), 226 states have call predecessors, (279), 231 states have call successors, (279) [2024-11-11 20:34:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 2407 transitions. [2024-11-11 20:34:13,297 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 2407 transitions. Word has length 92 [2024-11-11 20:34:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:13,297 INFO L471 AbstractCegarLoop]: Abstraction has 1446 states and 2407 transitions. [2024-11-11 20:34:13,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:34:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 2407 transitions. [2024-11-11 20:34:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-11 20:34:13,300 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:13,301 INFO L218 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, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:13,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:34:13,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:13,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:13,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1287267852, now seen corresponding path program 1 times [2024-11-11 20:34:13,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:13,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840569801] [2024-11-11 20:34:13,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:13,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:13,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:13,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:13,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:34:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:13,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:34:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:13,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:13,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:13,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:14,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:34:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:14,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:34:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:14,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:34:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:14,080 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-11 20:34:14,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:14,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840569801] [2024-11-11 20:34:14,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840569801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:14,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:14,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-11 20:34:14,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718436774] [2024-11-11 20:34:14,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:14,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 20:34:14,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:14,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 20:34:14,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:34:14,084 INFO L87 Difference]: Start difference. First operand 1446 states and 2407 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 10 states have internal predecessors, (75), 4 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-11 20:34:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:25,256 INFO L93 Difference]: Finished difference Result 3618 states and 6239 transitions. [2024-11-11 20:34:25,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-11 20:34:25,256 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 10 states have internal predecessors, (75), 4 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 96 [2024-11-11 20:34:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:25,271 INFO L225 Difference]: With dead ends: 3618 [2024-11-11 20:34:25,272 INFO L226 Difference]: Without dead ends: 2000 [2024-11-11 20:34:25,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2024-11-11 20:34:25,281 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 3609 mSDsluCounter, 4170 mSDsCounter, 0 mSdLazyCounter, 7953 mSolverCounterSat, 928 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3668 SdHoareTripleChecker+Valid, 4621 SdHoareTripleChecker+Invalid, 8881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 928 IncrementalHoareTripleChecker+Valid, 7953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:25,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3668 Valid, 4621 Invalid, 8881 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [928 Valid, 7953 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-11 20:34:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2024-11-11 20:34:25,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1450. [2024-11-11 20:34:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1147 states have (on average 1.6320836965998256) internal successors, (1872), 1198 states have internal predecessors, (1872), 236 states have call successors, (236), 61 states have call predecessors, (236), 66 states have return successors, (282), 226 states have call predecessors, (282), 231 states have call successors, (282) [2024-11-11 20:34:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2390 transitions. [2024-11-11 20:34:25,584 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2390 transitions. Word has length 96 [2024-11-11 20:34:25,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:25,584 INFO L471 AbstractCegarLoop]: Abstraction has 1450 states and 2390 transitions. [2024-11-11 20:34:25,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 10 states have internal predecessors, (75), 4 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-11 20:34:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2390 transitions. [2024-11-11 20:34:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 20:34:25,588 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:25,588 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:25,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:34:25,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:25,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:25,592 INFO L85 PathProgramCache]: Analyzing trace with hash -440641866, now seen corresponding path program 1 times [2024-11-11 20:34:25,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:25,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770988891] [2024-11-11 20:34:25,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:25,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:25,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:25,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:25,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:34:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:34:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:34:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:34:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:34:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 20:34:26,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:26,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770988891] [2024-11-11 20:34:26,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770988891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:26,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:26,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:34:26,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791658709] [2024-11-11 20:34:26,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:26,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:34:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:26,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:34:26,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:26,259 INFO L87 Difference]: Start difference. First operand 1450 states and 2390 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, (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-11 20:34:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:30,298 INFO L93 Difference]: Finished difference Result 3392 states and 5723 transitions. [2024-11-11 20:34:30,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:34:30,299 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, (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 99 [2024-11-11 20:34:30,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:30,313 INFO L225 Difference]: With dead ends: 3392 [2024-11-11 20:34:30,314 INFO L226 Difference]: Without dead ends: 1960 [2024-11-11 20:34:30,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:30,321 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 928 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 2805 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 3002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 2805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:30,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 1693 Invalid, 3002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 2805 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-11 20:34:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2024-11-11 20:34:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1450. [2024-11-11 20:34:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1147 states have (on average 1.6312118570183087) internal successors, (1871), 1198 states have internal predecessors, (1871), 236 states have call successors, (236), 61 states have call predecessors, (236), 66 states have return successors, (282), 226 states have call predecessors, (282), 231 states have call successors, (282) [2024-11-11 20:34:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2389 transitions. [2024-11-11 20:34:30,670 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2389 transitions. Word has length 99 [2024-11-11 20:34:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:30,671 INFO L471 AbstractCegarLoop]: Abstraction has 1450 states and 2389 transitions. [2024-11-11 20:34:30,672 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, (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-11 20:34:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2389 transitions. [2024-11-11 20:34:30,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 20:34:30,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:30,677 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:30,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:34:30,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:30,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:30,678 INFO L85 PathProgramCache]: Analyzing trace with hash -23222533, now seen corresponding path program 1 times [2024-11-11 20:34:30,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:30,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764914916] [2024-11-11 20:34:30,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:30,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:30,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:30,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:30,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:34:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:34:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:34:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:34:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 20:34:31,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:31,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764914916] [2024-11-11 20:34:31,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764914916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:31,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:31,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:34:31,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430657528] [2024-11-11 20:34:31,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:31,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:34:31,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:31,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:34:31,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:34:31,390 INFO L87 Difference]: Start difference. First operand 1450 states and 2389 transitions. Second operand has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:34:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:38,199 INFO L93 Difference]: Finished difference Result 3484 states and 5977 transitions. [2024-11-11 20:34:38,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 20:34:38,199 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2024-11-11 20:34:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:38,217 INFO L225 Difference]: With dead ends: 3484 [2024-11-11 20:34:38,217 INFO L226 Difference]: Without dead ends: 2092 [2024-11-11 20:34:38,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2024-11-11 20:34:38,227 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 1099 mSDsluCounter, 3638 mSDsCounter, 0 mSdLazyCounter, 6578 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 4110 SdHoareTripleChecker+Invalid, 6823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 6578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:38,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 4110 Invalid, 6823 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [245 Valid, 6578 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-11 20:34:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2024-11-11 20:34:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 1472. [2024-11-11 20:34:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 1158 states have (on average 1.6208981001727116) internal successors, (1877), 1216 states have internal predecessors, (1877), 240 states have call successors, (240), 61 states have call predecessors, (240), 73 states have return successors, (313), 230 states have call predecessors, (313), 235 states have call successors, (313) [2024-11-11 20:34:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2430 transitions. [2024-11-11 20:34:38,622 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 2430 transitions. Word has length 100 [2024-11-11 20:34:38,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:38,623 INFO L471 AbstractCegarLoop]: Abstraction has 1472 states and 2430 transitions. [2024-11-11 20:34:38,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:34:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 2430 transitions. [2024-11-11 20:34:38,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 20:34:38,627 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:38,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:38,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:34:38,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:38,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:38,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1402030415, now seen corresponding path program 1 times [2024-11-11 20:34:38,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:38,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490543319] [2024-11-11 20:34:38,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:38,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:38,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:38,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:38,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:39,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:34:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:39,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:39,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:39,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:39,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:39,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:34:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:39,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:34:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:39,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:34:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 20:34:39,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:39,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490543319] [2024-11-11 20:34:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490543319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:39,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:39,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:34:39,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540933429] [2024-11-11 20:34:39,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:39,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:34:39,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:39,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:34:39,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:39,260 INFO L87 Difference]: Start difference. First operand 1472 states and 2430 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (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-11 20:34:43,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:43,104 INFO L93 Difference]: Finished difference Result 3416 states and 5790 transitions. [2024-11-11 20:34:43,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:34:43,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (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 101 [2024-11-11 20:34:43,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:43,122 INFO L225 Difference]: With dead ends: 3416 [2024-11-11 20:34:43,122 INFO L226 Difference]: Without dead ends: 2002 [2024-11-11 20:34:43,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:34:43,131 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 1835 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1899 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 2993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:43,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1899 Valid, 1580 Invalid, 2993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 20:34:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2024-11-11 20:34:43,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1472. [2024-11-11 20:34:43,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 1158 states have (on average 1.616580310880829) internal successors, (1872), 1216 states have internal predecessors, (1872), 240 states have call successors, (240), 61 states have call predecessors, (240), 73 states have return successors, (313), 230 states have call predecessors, (313), 235 states have call successors, (313) [2024-11-11 20:34:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2425 transitions. [2024-11-11 20:34:43,499 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 2425 transitions. Word has length 101 [2024-11-11 20:34:43,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:43,500 INFO L471 AbstractCegarLoop]: Abstraction has 1472 states and 2425 transitions. [2024-11-11 20:34:43,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (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-11 20:34:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 2425 transitions. [2024-11-11 20:34:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-11 20:34:43,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:43,506 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:43,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:34:43,506 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:43,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:43,507 INFO L85 PathProgramCache]: Analyzing trace with hash -70366345, now seen corresponding path program 1 times [2024-11-11 20:34:43,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:43,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470790554] [2024-11-11 20:34:43,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:43,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:43,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:43,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:43,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:44,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:34:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:44,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:44,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:44,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:44,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:44,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:34:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:44,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:34:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:44,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:34:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 20:34:44,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:44,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470790554] [2024-11-11 20:34:44,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470790554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:44,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:44,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:34:44,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110147689] [2024-11-11 20:34:44,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:44,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:34:44,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:44,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:34:44,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:44,075 INFO L87 Difference]: Start difference. First operand 1472 states and 2425 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (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-11 20:34:47,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:47,812 INFO L93 Difference]: Finished difference Result 3416 states and 5785 transitions. [2024-11-11 20:34:47,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:34:47,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (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 102 [2024-11-11 20:34:47,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:47,827 INFO L225 Difference]: With dead ends: 3416 [2024-11-11 20:34:47,827 INFO L226 Difference]: Without dead ends: 2002 [2024-11-11 20:34:47,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:34:47,834 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 1424 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 2874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:47,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1632 Invalid, 2874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 2542 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 20:34:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2024-11-11 20:34:48,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1472. [2024-11-11 20:34:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 1158 states have (on average 1.6122625215889466) internal successors, (1867), 1216 states have internal predecessors, (1867), 240 states have call successors, (240), 61 states have call predecessors, (240), 73 states have return successors, (313), 230 states have call predecessors, (313), 235 states have call successors, (313) [2024-11-11 20:34:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2420 transitions. [2024-11-11 20:34:48,227 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 2420 transitions. Word has length 102 [2024-11-11 20:34:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:48,227 INFO L471 AbstractCegarLoop]: Abstraction has 1472 states and 2420 transitions. [2024-11-11 20:34:48,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (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-11 20:34:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 2420 transitions. [2024-11-11 20:34:48,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 20:34:48,230 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:48,230 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:48,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:34:48,231 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:48,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:48,231 INFO L85 PathProgramCache]: Analyzing trace with hash 49455051, now seen corresponding path program 1 times [2024-11-11 20:34:48,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:48,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073306428] [2024-11-11 20:34:48,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:48,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:48,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:48,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:48,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:48,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:34:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:48,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:48,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:48,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:48,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:48,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:34:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:48,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:34:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:48,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:34:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:48,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 20:34:48,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:48,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073306428] [2024-11-11 20:34:48,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073306428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:48,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:48,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:34:48,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558954955] [2024-11-11 20:34:48,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:48,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:34:48,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:48,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:34:48,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:48,777 INFO L87 Difference]: Start difference. First operand 1472 states and 2420 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:34:52,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:52,637 INFO L93 Difference]: Finished difference Result 3402 states and 5758 transitions. [2024-11-11 20:34:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:34:52,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-11-11 20:34:52,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:52,649 INFO L225 Difference]: With dead ends: 3402 [2024-11-11 20:34:52,649 INFO L226 Difference]: Without dead ends: 1994 [2024-11-11 20:34:52,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:34:52,655 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 1386 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 2499 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 2499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:52,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 1622 Invalid, 2826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 2499 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 20:34:52,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2024-11-11 20:34:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1474. [2024-11-11 20:34:52,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1160 states have (on average 1.611206896551724) internal successors, (1869), 1218 states have internal predecessors, (1869), 240 states have call successors, (240), 61 states have call predecessors, (240), 73 states have return successors, (313), 230 states have call predecessors, (313), 235 states have call successors, (313) [2024-11-11 20:34:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2422 transitions. [2024-11-11 20:34:52,990 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2422 transitions. Word has length 103 [2024-11-11 20:34:52,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:52,991 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 2422 transitions. [2024-11-11 20:34:52,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:34:52,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2422 transitions. [2024-11-11 20:34:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 20:34:52,993 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:52,993 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:52,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:34:52,994 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:52,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:52,994 INFO L85 PathProgramCache]: Analyzing trace with hash -489344436, now seen corresponding path program 1 times [2024-11-11 20:34:52,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:52,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046896838] [2024-11-11 20:34:52,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:52,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:34:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:34:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:34:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:34:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:34:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 20:34:53,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:53,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046896838] [2024-11-11 20:34:53,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046896838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:53,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:53,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:34:53,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019064413] [2024-11-11 20:34:53,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:53,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:34:53,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:53,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:34:53,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:53,581 INFO L87 Difference]: Start difference. First operand 1474 states and 2422 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (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)