./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product09.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 4cb164e6307f0ddcae5850d7f4578967441d1456f6ed5a5be472ba090758b873 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:50:18,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:50:18,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:50:18,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:50:18,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:50:18,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:50:18,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:50:18,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:50:18,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:50:18,238 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:50:18,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:50:18,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:50:18,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:50:18,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:50:18,240 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:50:18,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:50:18,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:50:18,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:50:18,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:50:18,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:50:18,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:50:18,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:50:18,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:50:18,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:50:18,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:50:18,244 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:50:18,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:50:18,245 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:50:18,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:50:18,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:50:18,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:50:18,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:50:18,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:50:18,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:50:18,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:50:18,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:50:18,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:50:18,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:50:18,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:50:18,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:50:18,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:50:18,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:50:18,254 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 -> 4cb164e6307f0ddcae5850d7f4578967441d1456f6ed5a5be472ba090758b873 [2024-11-08 14:50:18,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:50:18,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:50:18,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:50:18,565 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:50:18,566 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:50:18,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c [2024-11-08 14:50:19,945 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:50:20,304 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:50:20,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c [2024-11-08 14:50:20,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df844b4ae/d7ab2600d1b94e448bb04281b67550ef/FLAG747695769 [2024-11-08 14:50:20,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df844b4ae/d7ab2600d1b94e448bb04281b67550ef [2024-11-08 14:50:20,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:50:20,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:50:20,353 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:50:20,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:50:20,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:50:20,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:50:20" (1/1) ... [2024-11-08 14:50:20,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@119bbf1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:50:20, skipping insertion in model container [2024-11-08 14:50:20,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:50:20" (1/1) ... [2024-11-08 14:50:20,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:50:20,735 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_spec2_product09.cil.c[28842,28855] [2024-11-08 14:50:20,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:50:20,906 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:50:20,915 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2024-11-08 14:50:20,917 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [412] [2024-11-08 14:50:20,917 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [532] [2024-11-08 14:50:20,918 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [716] [2024-11-08 14:50:20,918 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1383] [2024-11-08 14:50:20,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1418] [2024-11-08 14:50:20,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1427] [2024-11-08 14:50:20,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2869] [2024-11-08 14:50:20,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3235] [2024-11-08 14:50:20,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3247] [2024-11-08 14:50:20,957 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_spec2_product09.cil.c[28842,28855] [2024-11-08 14:50:21,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:50:21,057 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:50:21,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:50:21 WrapperNode [2024-11-08 14:50:21,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:50:21,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:50:21,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:50:21,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:50:21,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:50:21" (1/1) ... [2024-11-08 14:50:21,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:50:21" (1/1) ... [2024-11-08 14:50:21,130 INFO L138 Inliner]: procedures = 89, calls = 330, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 811 [2024-11-08 14:50:21,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:50:21,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:50:21,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:50:21,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:50:21,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:50:21" (1/1) ... [2024-11-08 14:50:21,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:50:21" (1/1) ... [2024-11-08 14:50:21,152 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:50:21" (1/1) ... [2024-11-08 14:50:21,183 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-11-08 14:50:21,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:50:21" (1/1) ... [2024-11-08 14:50:21,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:50:21" (1/1) ... [2024-11-08 14:50:21,212 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:50:21" (1/1) ... [2024-11-08 14:50:21,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:50:21" (1/1) ... [2024-11-08 14:50:21,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:50:21" (1/1) ... [2024-11-08 14:50:21,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:50:21" (1/1) ... [2024-11-08 14:50:21,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:50:21,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:50:21,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:50:21,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:50:21,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:50:21" (1/1) ... [2024-11-08 14:50:21,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:50:21,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:50:21,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 14:50:21,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 14:50:21,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:50:21,382 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-08 14:50:21,382 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-08 14:50:21,382 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-08 14:50:21,382 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-08 14:50:21,382 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-08 14:50:21,382 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-08 14:50:21,382 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-08 14:50:21,383 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-08 14:50:21,383 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-08 14:50:21,383 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-08 14:50:21,384 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-08 14:50:21,384 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-08 14:50:21,384 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-11-08 14:50:21,384 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-11-08 14:50:21,385 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-08 14:50:21,385 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-08 14:50:21,385 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-08 14:50:21,385 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-08 14:50:21,387 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-08 14:50:21,391 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-08 14:50:21,391 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-08 14:50:21,391 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-08 14:50:21,391 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-08 14:50:21,392 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-08 14:50:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-08 14:50:21,392 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-08 14:50:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-08 14:50:21,392 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-08 14:50:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-08 14:50:21,392 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-08 14:50:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-08 14:50:21,393 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-08 14:50:21,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:50:21,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 14:50:21,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 14:50:21,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 14:50:21,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 14:50:21,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 14:50:21,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-08 14:50:21,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-08 14:50:21,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-08 14:50:21,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-08 14:50:21,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-08 14:50:21,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-08 14:50:21,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-08 14:50:21,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-08 14:50:21,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-08 14:50:21,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-08 14:50:21,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-08 14:50:21,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-08 14:50:21,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-08 14:50:21,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-08 14:50:21,394 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-08 14:50:21,394 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-08 14:50:21,394 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-08 14:50:21,394 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-08 14:50:21,394 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-08 14:50:21,394 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-08 14:50:21,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:50:21,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:50:21,395 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-08 14:50:21,395 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-08 14:50:21,587 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:50:21,593 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:50:22,753 INFO L? ?]: Removed 421 outVars from TransFormulas that were not future-live. [2024-11-08 14:50:22,754 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:50:22,785 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:50:22,785 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 14:50:22,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:50:22 BoogieIcfgContainer [2024-11-08 14:50:22,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:50:22,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:50:22,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:50:22,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:50:22,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:50:20" (1/3) ... [2024-11-08 14:50:22,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c51716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:50:22, skipping insertion in model container [2024-11-08 14:50:22,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:50:21" (2/3) ... [2024-11-08 14:50:22,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c51716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:50:22, skipping insertion in model container [2024-11-08 14:50:22,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:50:22" (3/3) ... [2024-11-08 14:50:22,794 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product09.cil.c [2024-11-08 14:50:22,810 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:50:22,811 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:50:22,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:50:22,901 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;@2e15e618, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:50:22,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:50:22,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 526 states, 418 states have (on average 1.7177033492822966) internal successors, (718), 439 states have internal predecessors, (718), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (86), 80 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-08 14:50:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 14:50:22,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:50:22,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:50:22,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:50:22,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:50:22,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1880911309, now seen corresponding path program 1 times [2024-11-08 14:50:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:50:22,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535848016] [2024-11-08 14:50:22,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:50:22,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:50:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:23,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:50:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:23,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:50:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:23,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:50:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:24,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 14:50:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:24,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:50:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:24,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:50:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:24,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 14:50:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:24,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 14:50:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:24,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:50:24,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:50:24,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535848016] [2024-11-08 14:50:24,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535848016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:50:24,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:50:24,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:50:24,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064992283] [2024-11-08 14:50:24,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:50:24,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:50:24,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:50:24,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:50:24,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:50:24,435 INFO L87 Difference]: Start difference. First operand has 526 states, 418 states have (on average 1.7177033492822966) internal successors, (718), 439 states have internal predecessors, (718), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (86), 80 states have call predecessors, (86), 86 states have call successors, (86) 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, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 14:50:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:50:32,120 INFO L93 Difference]: Finished difference Result 1304 states and 2257 transitions. [2024-11-08 14:50:32,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 14:50:32,124 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, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2024-11-08 14:50:32,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:50:32,158 INFO L225 Difference]: With dead ends: 1304 [2024-11-08 14:50:32,158 INFO L226 Difference]: Without dead ends: 790 [2024-11-08 14:50:32,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-11-08 14:50:32,175 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 974 mSDsluCounter, 2787 mSDsCounter, 0 mSdLazyCounter, 5328 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 3263 SdHoareTripleChecker+Invalid, 5534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 5328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-08 14:50:32,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 3263 Invalid, 5534 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [206 Valid, 5328 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-08 14:50:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-11-08 14:50:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 522. [2024-11-08 14:50:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 415 states have (on average 1.7084337349397591) internal successors, (709), 434 states have internal predecessors, (709), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (83), 80 states have call predecessors, (83), 81 states have call successors, (83) [2024-11-08 14:50:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 878 transitions. [2024-11-08 14:50:32,436 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 878 transitions. Word has length 74 [2024-11-08 14:50:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:50:32,437 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 878 transitions. [2024-11-08 14:50:32,437 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, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 14:50:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 878 transitions. [2024-11-08 14:50:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 14:50:32,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:50:32,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:50:32,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 14:50:32,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:50:32,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:50:32,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1918595941, now seen corresponding path program 1 times [2024-11-08 14:50:32,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:50:32,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945475081] [2024-11-08 14:50:32,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:50:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:50:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:32,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:50:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:32,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:50:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:32,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:50:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:33,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 14:50:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:50:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:33,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:50:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:33,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 14:50:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:33,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 14:50:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:50:33,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:50:33,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945475081] [2024-11-08 14:50:33,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945475081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:50:33,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:50:33,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 14:50:33,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896615535] [2024-11-08 14:50:33,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:50:33,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 14:50:33,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:50:33,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 14:50:33,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 14:50:33,277 INFO L87 Difference]: Start difference. First operand 522 states and 878 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 14:50:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:50:39,233 INFO L93 Difference]: Finished difference Result 1296 states and 2226 transitions. [2024-11-08 14:50:39,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 14:50:39,234 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2024-11-08 14:50:39,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:50:39,241 INFO L225 Difference]: With dead ends: 1296 [2024-11-08 14:50:39,241 INFO L226 Difference]: Without dead ends: 792 [2024-11-08 14:50:39,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-08 14:50:39,246 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 968 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 4521 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 4719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 4521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:50:39,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 2735 Invalid, 4719 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [198 Valid, 4521 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-08 14:50:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2024-11-08 14:50:39,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 524. [2024-11-08 14:50:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 417 states have (on average 1.7026378896882495) internal successors, (710), 436 states have internal predecessors, (710), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (83), 80 states have call predecessors, (83), 81 states have call successors, (83) [2024-11-08 14:50:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 879 transitions. [2024-11-08 14:50:39,362 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 879 transitions. Word has length 81 [2024-11-08 14:50:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:50:39,362 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 879 transitions. [2024-11-08 14:50:39,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 14:50:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 879 transitions. [2024-11-08 14:50:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 14:50:39,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:50:39,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:50:39,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 14:50:39,367 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:50:39,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:50:39,368 INFO L85 PathProgramCache]: Analyzing trace with hash 593345359, now seen corresponding path program 1 times [2024-11-08 14:50:39,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:50:39,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562261520] [2024-11-08 14:50:39,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:50:39,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:50:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:39,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:50:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:39,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:50:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:39,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:50:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:39,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 14:50:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:39,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:50:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:40,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:50:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:40,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:50:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:40,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 14:50:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:50:40,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:50:40,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562261520] [2024-11-08 14:50:40,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562261520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:50:40,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:50:40,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 14:50:40,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508490812] [2024-11-08 14:50:40,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:50:40,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 14:50:40,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:50:40,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 14:50:40,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:50:40,055 INFO L87 Difference]: Start difference. First operand 524 states and 879 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 14:50:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:50:51,766 INFO L93 Difference]: Finished difference Result 2467 states and 4405 transitions. [2024-11-08 14:50:51,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 14:50:51,766 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 85 [2024-11-08 14:50:51,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:50:51,784 INFO L225 Difference]: With dead ends: 2467 [2024-11-08 14:50:51,785 INFO L226 Difference]: Without dead ends: 1961 [2024-11-08 14:50:51,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2024-11-08 14:50:51,791 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 4252 mSDsluCounter, 3455 mSDsCounter, 0 mSdLazyCounter, 6010 mSolverCounterSat, 1282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4328 SdHoareTripleChecker+Valid, 4050 SdHoareTripleChecker+Invalid, 7292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1282 IncrementalHoareTripleChecker+Valid, 6010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-08 14:50:51,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4328 Valid, 4050 Invalid, 7292 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1282 Valid, 6010 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-08 14:50:51,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2024-11-08 14:50:52,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1377. [2024-11-08 14:50:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1085 states have (on average 1.6617511520737327) internal successors, (1803), 1132 states have internal predecessors, (1803), 235 states have call successors, (235), 53 states have call predecessors, (235), 56 states have return successors, (269), 227 states have call predecessors, (269), 230 states have call successors, (269) [2024-11-08 14:50:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2307 transitions. [2024-11-08 14:50:52,120 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2307 transitions. Word has length 85 [2024-11-08 14:50:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:50:52,120 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 2307 transitions. [2024-11-08 14:50:52,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 14:50:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2307 transitions. [2024-11-08 14:50:52,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 14:50:52,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:50:52,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:50:52,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 14:50:52,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:50:52,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:50:52,126 INFO L85 PathProgramCache]: Analyzing trace with hash -222070731, now seen corresponding path program 1 times [2024-11-08 14:50:52,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:50:52,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064794929] [2024-11-08 14:50:52,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:50:52,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:50:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:52,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:50:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:52,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:50:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:52,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 14:50:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:52,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 14:50:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:52,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:50:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:52,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:50:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:52,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:50:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:52,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:50:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:52,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 14:50:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:50:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:50:52,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:50:52,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064794929] [2024-11-08 14:50:52,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064794929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:50:52,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:50:52,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 14:50:52,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595562888] [2024-11-08 14:50:52,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:50:52,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 14:50:52,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:50:52,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 14:50:52,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:50:52,972 INFO L87 Difference]: Start difference. First operand 1377 states and 2307 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-08 14:50:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:50:59,640 INFO L93 Difference]: Finished difference Result 3458 states and 6065 transitions. [2024-11-08 14:50:59,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 14:50:59,641 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 94 [2024-11-08 14:50:59,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:50:59,657 INFO L225 Difference]: With dead ends: 3458 [2024-11-08 14:50:59,657 INFO L226 Difference]: Without dead ends: 1942 [2024-11-08 14:50:59,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-08 14:50:59,668 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 1364 mSDsluCounter, 3221 mSDsCounter, 0 mSdLazyCounter, 5833 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 3695 SdHoareTripleChecker+Invalid, 6094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 5833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-08 14:50:59,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 3695 Invalid, 6094 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [261 Valid, 5833 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-08 14:50:59,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2024-11-08 14:50:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1377. [2024-11-08 14:50:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1085 states have (on average 1.6451612903225807) internal successors, (1785), 1132 states have internal predecessors, (1785), 235 states have call successors, (235), 53 states have call predecessors, (235), 56 states have return successors, (269), 227 states have call predecessors, (269), 230 states have call successors, (269) [2024-11-08 14:50:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2289 transitions. [2024-11-08 14:50:59,950 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2289 transitions. Word has length 94 [2024-11-08 14:50:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:50:59,951 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 2289 transitions. [2024-11-08 14:50:59,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-08 14:50:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2289 transitions. [2024-11-08 14:50:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 14:50:59,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:50:59,954 INFO L215 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] [2024-11-08 14:50:59,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 14:50:59,955 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:50:59,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:50:59,955 INFO L85 PathProgramCache]: Analyzing trace with hash -470414669, now seen corresponding path program 1 times [2024-11-08 14:50:59,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:50:59,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056094620] [2024-11-08 14:50:59,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:50:59,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:50:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:00,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:51:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:00,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:00,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 14:51:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:00,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 14:51:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:00,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:00,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:00,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:51:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:00,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:51:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:00,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 14:51:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:00,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:51:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:00,530 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-08 14:51:00,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:51:00,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056094620] [2024-11-08 14:51:00,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056094620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:51:00,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:51:00,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:51:00,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950987954] [2024-11-08 14:51:00,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:51:00,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:51:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:51:00,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:51:00,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:51:00,532 INFO L87 Difference]: Start difference. First operand 1377 states and 2289 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, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 14:51:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:51:04,930 INFO L93 Difference]: Finished difference Result 3283 states and 5622 transitions. [2024-11-08 14:51:04,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 14:51:04,930 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, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2024-11-08 14:51:04,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:51:04,946 INFO L225 Difference]: With dead ends: 3283 [2024-11-08 14:51:04,947 INFO L226 Difference]: Without dead ends: 1924 [2024-11-08 14:51:04,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 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-08 14:51:04,955 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 949 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 2907 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 3105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:51:04,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1836 Invalid, 3105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2907 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-08 14:51:04,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2024-11-08 14:51:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1377. [2024-11-08 14:51:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1085 states have (on average 1.6442396313364056) internal successors, (1784), 1132 states have internal predecessors, (1784), 235 states have call successors, (235), 53 states have call predecessors, (235), 56 states have return successors, (269), 227 states have call predecessors, (269), 230 states have call successors, (269) [2024-11-08 14:51:05,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2288 transitions. [2024-11-08 14:51:05,267 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2288 transitions. Word has length 97 [2024-11-08 14:51:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:51:05,267 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 2288 transitions. [2024-11-08 14:51:05,267 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, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 14:51:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2288 transitions. [2024-11-08 14:51:05,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 14:51:05,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:51:05,272 INFO L215 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] [2024-11-08 14:51:05,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 14:51:05,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:51:05,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:51:05,274 INFO L85 PathProgramCache]: Analyzing trace with hash -23838419, now seen corresponding path program 1 times [2024-11-08 14:51:05,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:51:05,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102885596] [2024-11-08 14:51:05,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:51:05,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:51:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:05,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:51:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:05,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:05,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:51:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:05,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:51:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:05,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:05,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:51:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:05,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:51:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:05,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 14:51:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:05,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:51:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:05,973 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-08 14:51:05,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:51:05,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102885596] [2024-11-08 14:51:05,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102885596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:51:05,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:51:05,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 14:51:05,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603760353] [2024-11-08 14:51:05,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:51:05,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 14:51:05,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:51:05,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 14:51:05,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-08 14:51:05,977 INFO L87 Difference]: Start difference. First operand 1377 states and 2288 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, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-08 14:51:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:51:12,543 INFO L93 Difference]: Finished difference Result 3377 states and 5873 transitions. [2024-11-08 14:51:12,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 14:51:12,544 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, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 98 [2024-11-08 14:51:12,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:51:12,561 INFO L225 Difference]: With dead ends: 3377 [2024-11-08 14:51:12,561 INFO L226 Difference]: Without dead ends: 2058 [2024-11-08 14:51:12,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2024-11-08 14:51:12,570 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 1926 mSDsluCounter, 3911 mSDsCounter, 0 mSdLazyCounter, 6547 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1995 SdHoareTripleChecker+Valid, 4438 SdHoareTripleChecker+Invalid, 7069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 6547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:51:12,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1995 Valid, 4438 Invalid, 7069 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [522 Valid, 6547 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 14:51:12,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2024-11-08 14:51:12,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1397. [2024-11-08 14:51:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1095 states have (on average 1.6337899543378995) internal successors, (1789), 1149 states have internal predecessors, (1789), 238 states have call successors, (238), 53 states have call predecessors, (238), 63 states have return successors, (301), 230 states have call predecessors, (301), 233 states have call successors, (301) [2024-11-08 14:51:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2328 transitions. [2024-11-08 14:51:12,919 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2328 transitions. Word has length 98 [2024-11-08 14:51:12,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:51:12,920 INFO L471 AbstractCegarLoop]: Abstraction has 1397 states and 2328 transitions. [2024-11-08 14:51:12,920 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, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-08 14:51:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2328 transitions. [2024-11-08 14:51:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 14:51:12,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:51:12,924 INFO L215 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-08 14:51:12,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 14:51:12,925 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:51:12,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:51:12,925 INFO L85 PathProgramCache]: Analyzing trace with hash 896076395, now seen corresponding path program 1 times [2024-11-08 14:51:12,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:51:12,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065137119] [2024-11-08 14:51:12,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:51:12,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:51:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:13,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:51:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:13,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:13,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:51:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:13,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 14:51:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:13,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:13,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:13,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:51:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:13,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:51:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:13,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 14:51:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:13,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:51:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:13,628 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-08 14:51:13,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:51:13,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065137119] [2024-11-08 14:51:13,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065137119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:51:13,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:51:13,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 14:51:13,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908022602] [2024-11-08 14:51:13,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:51:13,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 14:51:13,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:51:13,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 14:51:13,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-08 14:51:13,630 INFO L87 Difference]: Start difference. First operand 1397 states and 2328 transitions. Second operand has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-08 14:51:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:51:21,335 INFO L93 Difference]: Finished difference Result 3324 states and 5725 transitions. [2024-11-08 14:51:21,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 14:51:21,336 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2024-11-08 14:51:21,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:51:21,351 INFO L225 Difference]: With dead ends: 3324 [2024-11-08 14:51:21,351 INFO L226 Difference]: Without dead ends: 1994 [2024-11-08 14:51:21,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2024-11-08 14:51:21,359 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 1106 mSDsluCounter, 3674 mSDsCounter, 0 mSdLazyCounter, 6715 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 4148 SdHoareTripleChecker+Invalid, 6918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 6715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-08 14:51:21,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 4148 Invalid, 6918 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [203 Valid, 6715 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-08 14:51:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2024-11-08 14:51:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1410. [2024-11-08 14:51:21,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1105 states have (on average 1.632579185520362) internal successors, (1804), 1161 states have internal predecessors, (1804), 239 states have call successors, (239), 53 states have call predecessors, (239), 65 states have return successors, (304), 231 states have call predecessors, (304), 234 states have call successors, (304) [2024-11-08 14:51:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2347 transitions. [2024-11-08 14:51:21,738 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2347 transitions. Word has length 99 [2024-11-08 14:51:21,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:51:21,739 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2347 transitions. [2024-11-08 14:51:21,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-08 14:51:21,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2347 transitions. [2024-11-08 14:51:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 14:51:21,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:51:21,743 INFO L215 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-08 14:51:21,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 14:51:21,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:51:21,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:51:21,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1679455370, now seen corresponding path program 1 times [2024-11-08 14:51:21,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:51:21,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741195398] [2024-11-08 14:51:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:51:21,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:51:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:21,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:51:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:21,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:21,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:51:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:22,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 14:51:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:22,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:22,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:22,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:51:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:22,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:51:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:22,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 14:51:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:22,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:51:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:22,306 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-08 14:51:22,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:51:22,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741195398] [2024-11-08 14:51:22,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741195398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:51:22,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:51:22,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:51:22,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749990443] [2024-11-08 14:51:22,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:51:22,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:51:22,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:51:22,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:51:22,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:51:22,309 INFO L87 Difference]: Start difference. First operand 1410 states and 2347 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, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 14:51:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:51:26,391 INFO L93 Difference]: Finished difference Result 3332 states and 5735 transitions. [2024-11-08 14:51:26,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:51:26,391 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, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2024-11-08 14:51:26,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:51:26,409 INFO L225 Difference]: With dead ends: 3332 [2024-11-08 14:51:26,410 INFO L226 Difference]: Without dead ends: 1984 [2024-11-08 14:51:26,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 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-08 14:51:26,418 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 1806 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 2621 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1876 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 2621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:51:26,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1876 Valid, 1716 Invalid, 3090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 2621 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 14:51:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2024-11-08 14:51:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1410. [2024-11-08 14:51:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1105 states have (on average 1.628054298642534) internal successors, (1799), 1161 states have internal predecessors, (1799), 239 states have call successors, (239), 53 states have call predecessors, (239), 65 states have return successors, (304), 231 states have call predecessors, (304), 234 states have call successors, (304) [2024-11-08 14:51:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2342 transitions. [2024-11-08 14:51:26,831 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2342 transitions. Word has length 99 [2024-11-08 14:51:26,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:51:26,831 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2342 transitions. [2024-11-08 14:51:26,831 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, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 14:51:26,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2342 transitions. [2024-11-08 14:51:26,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 14:51:26,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:51:26,836 INFO L215 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-08 14:51:26,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 14:51:26,836 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:51:26,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:51:26,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1379913878, now seen corresponding path program 1 times [2024-11-08 14:51:26,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:51:26,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248726416] [2024-11-08 14:51:26,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:51:26,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:51:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:27,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:51:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:27,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:27,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:51:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:27,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 14:51:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:27,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:27,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:27,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:51:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:27,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:51:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:27,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 14:51:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:27,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:51:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:27,546 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-08 14:51:27,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:51:27,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248726416] [2024-11-08 14:51:27,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248726416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:51:27,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:51:27,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:51:27,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268390003] [2024-11-08 14:51:27,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:51:27,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:51:27,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:51:27,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:51:27,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:51:27,548 INFO L87 Difference]: Start difference. First operand 1410 states and 2342 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, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 14:51:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:51:31,551 INFO L93 Difference]: Finished difference Result 3332 states and 5730 transitions. [2024-11-08 14:51:31,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:51:31,551 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, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2024-11-08 14:51:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:51:31,568 INFO L225 Difference]: With dead ends: 3332 [2024-11-08 14:51:31,568 INFO L226 Difference]: Without dead ends: 1984 [2024-11-08 14:51:31,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:51:31,577 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 1410 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 2993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 2667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:51:31,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1792 Invalid, 2993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 2667 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 14:51:31,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2024-11-08 14:51:31,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1410. [2024-11-08 14:51:31,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1105 states have (on average 1.6235294117647059) internal successors, (1794), 1161 states have internal predecessors, (1794), 239 states have call successors, (239), 53 states have call predecessors, (239), 65 states have return successors, (304), 231 states have call predecessors, (304), 234 states have call successors, (304) [2024-11-08 14:51:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2337 transitions. [2024-11-08 14:51:31,965 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2337 transitions. Word has length 100 [2024-11-08 14:51:31,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:51:31,965 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2337 transitions. [2024-11-08 14:51:31,965 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, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 14:51:31,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2337 transitions. [2024-11-08 14:51:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 14:51:31,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:51:31,969 INFO L215 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-08 14:51:31,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 14:51:31,969 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:51:31,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:51:31,969 INFO L85 PathProgramCache]: Analyzing trace with hash 486977061, now seen corresponding path program 1 times [2024-11-08 14:51:31,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:51:31,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377524752] [2024-11-08 14:51:31,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:51:31,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:51:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:32,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:51:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:32,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:32,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:51:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:32,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 14:51:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:32,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:32,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:32,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:51:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:32,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:51:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:32,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 14:51:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:32,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:51:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:32,585 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-08 14:51:32,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:51:32,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377524752] [2024-11-08 14:51:32,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377524752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:51:32,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:51:32,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:51:32,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888292494] [2024-11-08 14:51:32,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:51:32,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:51:32,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:51:32,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:51:32,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:51:32,588 INFO L87 Difference]: Start difference. First operand 1410 states and 2337 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, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 14:51:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:51:36,940 INFO L93 Difference]: Finished difference Result 3332 states and 5725 transitions. [2024-11-08 14:51:36,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:51:36,941 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, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2024-11-08 14:51:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:51:36,957 INFO L225 Difference]: With dead ends: 3332 [2024-11-08 14:51:36,957 INFO L226 Difference]: Without dead ends: 1984 [2024-11-08 14:51:36,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 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-08 14:51:36,964 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 1012 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 2821 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 2821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-08 14:51:36,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 1864 Invalid, 3018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 2821 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-08 14:51:36,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2024-11-08 14:51:37,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1410. [2024-11-08 14:51:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1105 states have (on average 1.6190045248868778) internal successors, (1789), 1161 states have internal predecessors, (1789), 239 states have call successors, (239), 53 states have call predecessors, (239), 65 states have return successors, (304), 231 states have call predecessors, (304), 234 states have call successors, (304) [2024-11-08 14:51:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2332 transitions. [2024-11-08 14:51:37,341 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2332 transitions. Word has length 101 [2024-11-08 14:51:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:51:37,341 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2332 transitions. [2024-11-08 14:51:37,341 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, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 14:51:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2332 transitions. [2024-11-08 14:51:37,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 14:51:37,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:51:37,345 INFO L215 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-08 14:51:37,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 14:51:37,345 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:51:37,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:51:37,345 INFO L85 PathProgramCache]: Analyzing trace with hash -330338460, now seen corresponding path program 1 times [2024-11-08 14:51:37,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:51:37,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226082656] [2024-11-08 14:51:37,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:51:37,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:51:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:37,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:51:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:37,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:37,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:51:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:37,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 14:51:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:37,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:37,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:37,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:51:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:37,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:51:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:37,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 14:51:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:37,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:51:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:37,887 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-08 14:51:37,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:51:37,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226082656] [2024-11-08 14:51:37,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226082656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:51:37,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:51:37,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:51:37,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872624975] [2024-11-08 14:51:37,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:51:37,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:51:37,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:51:37,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:51:37,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:51:37,890 INFO L87 Difference]: Start difference. First operand 1410 states and 2332 transitions. Second operand has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10)