./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product28.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product28.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 cb2818f0d8bce3a3c55c338823c603b0097898f29d2ecfaf46bb61225da928d8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:48:01,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:48:02,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:48:02,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:48:02,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:48:02,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:48:02,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:48:02,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:48:02,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:48:02,065 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:48:02,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:48:02,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:48:02,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:48:02,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:48:02,068 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:48:02,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:48:02,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:48:02,070 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:48:02,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:48:02,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:48:02,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:48:02,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:48:02,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:48:02,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:48:02,076 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:48:02,076 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:48:02,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:48:02,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:48:02,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:48:02,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:48:02,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:48:02,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:48:02,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:48:02,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:48:02,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:48:02,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:48:02,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:48:02,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:48:02,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:48:02,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:48:02,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:48:02,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:48:02,082 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 -> cb2818f0d8bce3a3c55c338823c603b0097898f29d2ecfaf46bb61225da928d8 [2024-10-14 02:48:02,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:48:02,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:48:02,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:48:02,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:48:02,365 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:48:02,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product28.cil.c [2024-10-14 02:48:03,823 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:48:04,129 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:48:04,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product28.cil.c [2024-10-14 02:48:04,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cde2108e/8a2a9a9fc33942febdad5dbe32d2ceb8/FLAG9a096c187 [2024-10-14 02:48:04,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cde2108e/8a2a9a9fc33942febdad5dbe32d2ceb8 [2024-10-14 02:48:04,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:48:04,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:48:04,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:48:04,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:48:04,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:48:04,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:48:04" (1/1) ... [2024-10-14 02:48:04,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50f7f6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:04, skipping insertion in model container [2024-10-14 02:48:04,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:48:04" (1/1) ... [2024-10-14 02:48:04,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:48:04,876 WARN L248 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_spec3_product28.cil.c[73221,73234] [2024-10-14 02:48:04,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:48:04,896 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:48:04,905 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [48] [2024-10-14 02:48:04,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [242] [2024-10-14 02:48:04,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1847] [2024-10-14 02:48:04,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2213] [2024-10-14 02:48:04,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2231] [2024-10-14 02:48:04,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2350] [2024-10-14 02:48:04,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2703] [2024-10-14 02:48:04,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3364] [2024-10-14 02:48:04,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3455] [2024-10-14 02:48:04,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3464] [2024-10-14 02:48:05,038 WARN L248 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_spec3_product28.cil.c[73221,73234] [2024-10-14 02:48:05,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:48:05,074 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:48:05,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:05 WrapperNode [2024-10-14 02:48:05,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:48:05,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:48:05,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:48:05,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:48:05,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:05" (1/1) ... [2024-10-14 02:48:05,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:05" (1/1) ... [2024-10-14 02:48:05,195 INFO L138 Inliner]: procedures = 95, calls = 354, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 1155 [2024-10-14 02:48:05,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:48:05,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:48:05,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:48:05,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:48:05,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:05" (1/1) ... [2024-10-14 02:48:05,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:05" (1/1) ... [2024-10-14 02:48:05,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:05" (1/1) ... [2024-10-14 02:48:05,265 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-10-14 02:48:05,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:05" (1/1) ... [2024-10-14 02:48:05,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:05" (1/1) ... [2024-10-14 02:48:05,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:05" (1/1) ... [2024-10-14 02:48:05,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:05" (1/1) ... [2024-10-14 02:48:05,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:05" (1/1) ... [2024-10-14 02:48:05,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:05" (1/1) ... [2024-10-14 02:48:05,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:48:05,325 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:48:05,325 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:48:05,326 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:48:05,326 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:05" (1/1) ... [2024-10-14 02:48:05,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:48:05,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:48:05,360 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-10-14 02:48:05,365 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-10-14 02:48:05,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:48:05,412 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-10-14 02:48:05,412 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-10-14 02:48:05,412 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-14 02:48:05,413 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-14 02:48:05,413 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-14 02:48:05,413 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-14 02:48:05,413 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-14 02:48:05,413 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-14 02:48:05,413 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-14 02:48:05,413 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-14 02:48:05,413 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-14 02:48:05,413 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-14 02:48:05,413 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-14 02:48:05,414 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-14 02:48:05,414 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 02:48:05,414 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 02:48:05,414 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 02:48:05,414 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 02:48:05,414 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-14 02:48:05,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-14 02:48:05,414 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-14 02:48:05,414 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-14 02:48:05,414 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-14 02:48:05,414 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-14 02:48:05,414 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-14 02:48:05,415 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-14 02:48:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-14 02:48:05,415 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-14 02:48:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-10-14 02:48:05,415 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-10-14 02:48:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-14 02:48:05,415 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-14 02:48:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-10-14 02:48:05,415 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-10-14 02:48:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-14 02:48:05,415 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-14 02:48:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-10-14 02:48:05,416 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-10-14 02:48:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-14 02:48:05,416 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-14 02:48:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-14 02:48:05,416 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-14 02:48:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-14 02:48:05,416 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-14 02:48:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:48:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 02:48:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 02:48:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 02:48:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 02:48:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 02:48:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 02:48:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 02:48:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 02:48:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 02:48:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 02:48:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 02:48:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 02:48:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 02:48:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 02:48:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-14 02:48:05,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-14 02:48:05,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-14 02:48:05,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-14 02:48:05,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-14 02:48:05,418 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-14 02:48:05,418 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-14 02:48:05,418 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-14 02:48:05,418 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-14 02:48:05,418 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-14 02:48:05,418 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-14 02:48:05,418 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-14 02:48:05,418 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-14 02:48:05,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:48:05,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:48:05,419 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-14 02:48:05,419 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-14 02:48:05,419 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-10-14 02:48:05,419 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-10-14 02:48:05,599 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:48:05,603 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:48:06,826 INFO L? ?]: Removed 473 outVars from TransFormulas that were not future-live. [2024-10-14 02:48:06,826 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:48:06,902 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:48:06,902 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:48:06,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:48:06 BoogieIcfgContainer [2024-10-14 02:48:06,902 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:48:06,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:48:06,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:48:06,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:48:06,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:48:04" (1/3) ... [2024-10-14 02:48:06,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c96aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:48:06, skipping insertion in model container [2024-10-14 02:48:06,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:05" (2/3) ... [2024-10-14 02:48:06,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c96aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:48:06, skipping insertion in model container [2024-10-14 02:48:06,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:48:06" (3/3) ... [2024-10-14 02:48:06,916 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product28.cil.c [2024-10-14 02:48:06,941 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:48:06,941 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:48:07,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:48:07,042 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;@1f4469d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:48:07,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:48:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 583 states, 443 states have (on average 1.7020316027088036) internal successors, (754), 463 states have internal predecessors, (754), 110 states have call successors, (110), 28 states have call predecessors, (110), 28 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-14 02:48:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 02:48:07,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:07,067 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:48:07,067 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:07,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:07,074 INFO L85 PathProgramCache]: Analyzing trace with hash -434223233, now seen corresponding path program 1 times [2024-10-14 02:48:07,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:07,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841082567] [2024-10-14 02:48:07,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:07,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:48:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:48:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:48:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:48:08,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:08,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841082567] [2024-10-14 02:48:08,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841082567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:08,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:08,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:48:08,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837631105] [2024-10-14 02:48:08,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:08,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:48:08,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:08,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:48:08,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:48:08,558 INFO L87 Difference]: Start difference. First operand has 583 states, 443 states have (on average 1.7020316027088036) internal successors, (754), 463 states have internal predecessors, (754), 110 states have call successors, (110), 28 states have call predecessors, (110), 28 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:48:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:16,183 INFO L93 Difference]: Finished difference Result 1441 states and 2503 transitions. [2024-10-14 02:48:16,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:48:16,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 56 [2024-10-14 02:48:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:16,213 INFO L225 Difference]: With dead ends: 1441 [2024-10-14 02:48:16,213 INFO L226 Difference]: Without dead ends: 859 [2024-10-14 02:48:16,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-14 02:48:16,231 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 914 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 5335 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 5538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 5335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:16,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 2212 Invalid, 5538 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [203 Valid, 5335 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-14 02:48:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-10-14 02:48:16,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 589. [2024-10-14 02:48:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 449 states have (on average 1.688195991091314) internal successors, (758), 469 states have internal predecessors, (758), 111 states have call successors, (111), 28 states have call predecessors, (111), 28 states have return successors, (110), 105 states have call predecessors, (110), 108 states have call successors, (110) [2024-10-14 02:48:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 979 transitions. [2024-10-14 02:48:16,534 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 979 transitions. Word has length 56 [2024-10-14 02:48:16,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:16,535 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 979 transitions. [2024-10-14 02:48:16,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:48:16,536 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 979 transitions. [2024-10-14 02:48:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 02:48:16,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:16,542 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:48:16,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:48:16,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:16,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:16,543 INFO L85 PathProgramCache]: Analyzing trace with hash -322578571, now seen corresponding path program 1 times [2024-10-14 02:48:16,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:16,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879320566] [2024-10-14 02:48:16,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:16,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:16,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:17,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:17,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:17,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:17,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:17,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:48:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:17,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:48:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:17,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:48:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:48:17,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:17,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879320566] [2024-10-14 02:48:17,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879320566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:17,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:17,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:48:17,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100900471] [2024-10-14 02:48:17,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:17,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:48:17,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:17,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:48:17,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:48:17,234 INFO L87 Difference]: Start difference. First operand 589 states and 979 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:48:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:23,535 INFO L93 Difference]: Finished difference Result 1438 states and 2470 transitions. [2024-10-14 02:48:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:48:23,535 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 57 [2024-10-14 02:48:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:23,543 INFO L225 Difference]: With dead ends: 1438 [2024-10-14 02:48:23,544 INFO L226 Difference]: Without dead ends: 859 [2024-10-14 02:48:23,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:48:23,548 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 1489 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 5142 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1600 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 5581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 5142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:23,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1600 Valid, 2084 Invalid, 5581 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [439 Valid, 5142 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-14 02:48:23,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-10-14 02:48:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 589. [2024-10-14 02:48:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 449 states have (on average 1.6859688195991092) internal successors, (757), 469 states have internal predecessors, (757), 111 states have call successors, (111), 28 states have call predecessors, (111), 28 states have return successors, (110), 105 states have call predecessors, (110), 108 states have call successors, (110) [2024-10-14 02:48:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 978 transitions. [2024-10-14 02:48:23,665 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 978 transitions. Word has length 57 [2024-10-14 02:48:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:23,666 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 978 transitions. [2024-10-14 02:48:23,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:48:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 978 transitions. [2024-10-14 02:48:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 02:48:23,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:23,673 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:48:23,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:48:23,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:23,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:23,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1461948787, now seen corresponding path program 1 times [2024-10-14 02:48:23,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:23,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313002754] [2024-10-14 02:48:23,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:23,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:23,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:24,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:24,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:24,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:24,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:48:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:24,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:48:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:24,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:48:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:24,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:48:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:48:24,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:24,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313002754] [2024-10-14 02:48:24,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313002754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:24,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:24,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:48:24,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377257345] [2024-10-14 02:48:24,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:24,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:48:24,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:24,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:48:24,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:48:24,204 INFO L87 Difference]: Start difference. First operand 589 states and 978 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:48:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:28,978 INFO L93 Difference]: Finished difference Result 1432 states and 2453 transitions. [2024-10-14 02:48:28,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:48:28,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2024-10-14 02:48:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:28,986 INFO L225 Difference]: With dead ends: 1432 [2024-10-14 02:48:28,986 INFO L226 Difference]: Without dead ends: 824 [2024-10-14 02:48:28,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:48:28,990 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1435 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 2701 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 2701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:28,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 1168 Invalid, 3126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 2701 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-14 02:48:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-10-14 02:48:29,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 566. [2024-10-14 02:48:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 429 states have (on average 1.675990675990676) internal successors, (719), 447 states have internal predecessors, (719), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-14 02:48:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 936 transitions. [2024-10-14 02:48:29,118 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 936 transitions. Word has length 57 [2024-10-14 02:48:29,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:29,119 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 936 transitions. [2024-10-14 02:48:29,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:48:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 936 transitions. [2024-10-14 02:48:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 02:48:29,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:29,122 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:48:29,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 02:48:29,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:29,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:29,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1832204659, now seen corresponding path program 1 times [2024-10-14 02:48:29,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:29,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456429450] [2024-10-14 02:48:29,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:29,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:48:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:48:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 02:48:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:48:29,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:29,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456429450] [2024-10-14 02:48:29,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456429450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:29,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:29,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:48:29,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980068905] [2024-10-14 02:48:29,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:29,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:48:29,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:29,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:48:29,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:48:29,825 INFO L87 Difference]: Start difference. First operand 566 states and 936 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:48:35,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:35,409 INFO L93 Difference]: Finished difference Result 1396 states and 2385 transitions. [2024-10-14 02:48:35,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:48:35,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 58 [2024-10-14 02:48:35,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:35,417 INFO L225 Difference]: With dead ends: 1396 [2024-10-14 02:48:35,417 INFO L226 Difference]: Without dead ends: 818 [2024-10-14 02:48:35,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-14 02:48:35,425 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 1463 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 4977 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 5410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 4977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:35,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 2102 Invalid, 5410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 4977 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 02:48:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-10-14 02:48:35,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 560. [2024-10-14 02:48:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 423 states have (on average 1.66903073286052) internal successors, (706), 441 states have internal predecessors, (706), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-14 02:48:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 923 transitions. [2024-10-14 02:48:35,562 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 923 transitions. Word has length 58 [2024-10-14 02:48:35,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:35,562 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 923 transitions. [2024-10-14 02:48:35,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:48:35,563 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 923 transitions. [2024-10-14 02:48:35,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 02:48:35,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:35,565 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:48:35,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 02:48:35,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:35,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash 735207949, now seen corresponding path program 1 times [2024-10-14 02:48:35,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:35,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296753917] [2024-10-14 02:48:35,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:35,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:36,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:36,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:36,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:36,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:36,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 02:48:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:36,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:48:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:36,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 02:48:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:48:36,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:36,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296753917] [2024-10-14 02:48:36,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296753917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:36,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:36,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:48:36,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406676511] [2024-10-14 02:48:36,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:36,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:48:36,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:36,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:48:36,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:48:36,205 INFO L87 Difference]: Start difference. First operand 560 states and 923 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:48:41,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:41,722 INFO L93 Difference]: Finished difference Result 1368 states and 2336 transitions. [2024-10-14 02:48:41,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:48:41,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 59 [2024-10-14 02:48:41,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:41,728 INFO L225 Difference]: With dead ends: 1368 [2024-10-14 02:48:41,728 INFO L226 Difference]: Without dead ends: 818 [2024-10-14 02:48:41,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:48:41,732 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 831 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 5030 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 5230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 5030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:41,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 2118 Invalid, 5230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 5030 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-14 02:48:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-10-14 02:48:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 560. [2024-10-14 02:48:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 423 states have (on average 1.6666666666666667) internal successors, (705), 441 states have internal predecessors, (705), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-14 02:48:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 922 transitions. [2024-10-14 02:48:41,860 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 922 transitions. Word has length 59 [2024-10-14 02:48:41,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:41,860 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 922 transitions. [2024-10-14 02:48:41,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:48:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 922 transitions. [2024-10-14 02:48:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 02:48:41,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:41,862 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:48:41,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:48:41,862 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:41,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1096341110, now seen corresponding path program 1 times [2024-10-14 02:48:41,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:41,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624565671] [2024-10-14 02:48:41,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:41,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:48:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 02:48:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:48:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:48:42,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:42,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624565671] [2024-10-14 02:48:42,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624565671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:42,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:42,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:48:42,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347169794] [2024-10-14 02:48:42,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:42,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:48:42,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:42,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:48:42,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:48:42,482 INFO L87 Difference]: Start difference. First operand 560 states and 922 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:48:47,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:47,781 INFO L93 Difference]: Finished difference Result 1384 states and 2354 transitions. [2024-10-14 02:48:47,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:48:47,782 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2024-10-14 02:48:47,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:47,787 INFO L225 Difference]: With dead ends: 1384 [2024-10-14 02:48:47,787 INFO L226 Difference]: Without dead ends: 812 [2024-10-14 02:48:47,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-14 02:48:47,791 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 1432 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 4896 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 5323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 4896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:47,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 2096 Invalid, 5323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 4896 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-14 02:48:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-14 02:48:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 554. [2024-10-14 02:48:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 417 states have (on average 1.65947242206235) internal successors, (692), 435 states have internal predecessors, (692), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-14 02:48:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 909 transitions. [2024-10-14 02:48:47,917 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 909 transitions. Word has length 60 [2024-10-14 02:48:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:47,918 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 909 transitions. [2024-10-14 02:48:47,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:48:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 909 transitions. [2024-10-14 02:48:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 02:48:47,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:47,919 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:48:47,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:48:47,919 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:47,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:47,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2102953803, now seen corresponding path program 1 times [2024-10-14 02:48:47,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:47,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493809890] [2024-10-14 02:48:47,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:47,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:48,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:48,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:48,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:48,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:48,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:48,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:48:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:48,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 02:48:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:48,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 02:48:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:48:48,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:48,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493809890] [2024-10-14 02:48:48,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493809890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:48,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:48,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:48:48,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196833392] [2024-10-14 02:48:48,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:48,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:48:48,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:48,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:48:48,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:48:48,439 INFO L87 Difference]: Start difference. First operand 554 states and 909 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:48:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:53,633 INFO L93 Difference]: Finished difference Result 1356 states and 2307 transitions. [2024-10-14 02:48:53,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:48:53,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2024-10-14 02:48:53,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:53,639 INFO L225 Difference]: With dead ends: 1356 [2024-10-14 02:48:53,639 INFO L226 Difference]: Without dead ends: 812 [2024-10-14 02:48:53,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:48:53,642 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 811 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 4881 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 5081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 4881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:53,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 2110 Invalid, 5081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 4881 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-14 02:48:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-14 02:48:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 554. [2024-10-14 02:48:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 417 states have (on average 1.6570743405275778) internal successors, (691), 435 states have internal predecessors, (691), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-14 02:48:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 908 transitions. [2024-10-14 02:48:53,729 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 908 transitions. Word has length 61 [2024-10-14 02:48:53,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:53,729 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 908 transitions. [2024-10-14 02:48:53,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:48:53,730 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 908 transitions. [2024-10-14 02:48:53,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 02:48:53,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:53,732 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:48:53,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:48:53,732 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:53,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:53,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1379282323, now seen corresponding path program 1 times [2024-10-14 02:48:53,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:53,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131192102] [2024-10-14 02:48:53,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:53,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:54,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:54,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:54,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:54,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:54,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:54,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:48:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:54,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 02:48:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:54,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 02:48:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:48:54,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:54,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131192102] [2024-10-14 02:48:54,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131192102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:54,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:54,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:48:54,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307267893] [2024-10-14 02:48:54,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:54,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:48:54,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:54,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:48:54,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:48:54,256 INFO L87 Difference]: Start difference. First operand 554 states and 908 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:48:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:59,532 INFO L93 Difference]: Finished difference Result 1366 states and 2316 transitions. [2024-10-14 02:48:59,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:48:59,533 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2024-10-14 02:48:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:59,539 INFO L225 Difference]: With dead ends: 1366 [2024-10-14 02:48:59,539 INFO L226 Difference]: Without dead ends: 822 [2024-10-14 02:48:59,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:48:59,542 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 800 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 4925 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 5129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 4925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:59,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 2078 Invalid, 5129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 4925 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-14 02:48:59,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-10-14 02:48:59,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 559. [2024-10-14 02:48:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 422 states have (on average 1.6492890995260663) internal successors, (696), 440 states have internal predecessors, (696), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-14 02:48:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 913 transitions. [2024-10-14 02:48:59,635 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 913 transitions. Word has length 62 [2024-10-14 02:48:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:59,635 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 913 transitions. [2024-10-14 02:48:59,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:48:59,636 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 913 transitions. [2024-10-14 02:48:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 02:48:59,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:59,637 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:48:59,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:48:59,637 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:59,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:59,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1159356946, now seen corresponding path program 1 times [2024-10-14 02:48:59,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:59,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191528433] [2024-10-14 02:48:59,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:59,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:59,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:00,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:00,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:49:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:00,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:00,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:49:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:00,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:49:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:00,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 02:49:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:00,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 02:49:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:49:00,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:00,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191528433] [2024-10-14 02:49:00,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191528433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:00,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:00,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:49:00,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193887699] [2024-10-14 02:49:00,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:00,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:49:00,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:00,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:49:00,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:49:00,218 INFO L87 Difference]: Start difference. First operand 559 states and 913 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:49:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:05,659 INFO L93 Difference]: Finished difference Result 1377 states and 2326 transitions. [2024-10-14 02:49:05,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:49:05,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2024-10-14 02:49:05,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:05,664 INFO L225 Difference]: With dead ends: 1377 [2024-10-14 02:49:05,664 INFO L226 Difference]: Without dead ends: 806 [2024-10-14 02:49:05,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-14 02:49:05,667 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 823 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 4917 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 5121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 4917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:05,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 2117 Invalid, 5121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 4917 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-14 02:49:05,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-10-14 02:49:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 548. [2024-10-14 02:49:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 411 states have (on average 1.6472019464720196) internal successors, (677), 429 states have internal predecessors, (677), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-14 02:49:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 894 transitions. [2024-10-14 02:49:05,768 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 894 transitions. Word has length 62 [2024-10-14 02:49:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:05,768 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 894 transitions. [2024-10-14 02:49:05,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:49:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 894 transitions. [2024-10-14 02:49:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 02:49:05,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:05,770 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:49:05,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 02:49:05,770 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:05,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:05,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1252795622, now seen corresponding path program 1 times [2024-10-14 02:49:05,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:05,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664629859] [2024-10-14 02:49:05,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:05,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:06,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:06,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:06,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:49:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:06,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:06,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:49:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:06,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:49:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:06,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:49:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:06,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 02:49:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:49:06,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:06,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664629859] [2024-10-14 02:49:06,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664629859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:06,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:06,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:49:06,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161790506] [2024-10-14 02:49:06,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:06,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:49:06,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:06,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:49:06,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:49:06,327 INFO L87 Difference]: Start difference. First operand 548 states and 894 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:49:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:11,499 INFO L93 Difference]: Finished difference Result 1350 states and 2282 transitions. [2024-10-14 02:49:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 02:49:11,499 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2024-10-14 02:49:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:11,503 INFO L225 Difference]: With dead ends: 1350 [2024-10-14 02:49:11,503 INFO L226 Difference]: Without dead ends: 812 [2024-10-14 02:49:11,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:49:11,505 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 1354 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 4687 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 5117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 4687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:11,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 2089 Invalid, 5117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 4687 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-14 02:49:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-14 02:49:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 554. [2024-10-14 02:49:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 417 states have (on average 1.6378896882494005) internal successors, (683), 435 states have internal predecessors, (683), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-14 02:49:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 900 transitions. [2024-10-14 02:49:11,609 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 900 transitions. Word has length 63 [2024-10-14 02:49:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:11,609 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 900 transitions. [2024-10-14 02:49:11,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:49:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 900 transitions. [2024-10-14 02:49:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 02:49:11,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:11,610 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:49:11,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 02:49:11,611 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:11,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:11,611 INFO L85 PathProgramCache]: Analyzing trace with hash -991187676, now seen corresponding path program 1 times [2024-10-14 02:49:11,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:11,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067917526] [2024-10-14 02:49:11,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:11,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:11,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:12,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:12,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:49:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:12,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:12,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:49:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:12,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:49:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:12,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:49:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:12,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 02:49:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:49:12,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:12,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067917526] [2024-10-14 02:49:12,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067917526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:12,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:12,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:49:12,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485353370] [2024-10-14 02:49:12,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:12,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:49:12,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:12,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:49:12,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:49:12,149 INFO L87 Difference]: Start difference. First operand 554 states and 900 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:49:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:17,651 INFO L93 Difference]: Finished difference Result 1358 states and 2288 transitions. [2024-10-14 02:49:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:49:17,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2024-10-14 02:49:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:17,656 INFO L225 Difference]: With dead ends: 1358 [2024-10-14 02:49:17,656 INFO L226 Difference]: Without dead ends: 806 [2024-10-14 02:49:17,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-14 02:49:17,659 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 795 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 4813 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 2150 SdHoareTripleChecker+Invalid, 5013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 4813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:17,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 2150 Invalid, 5013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 4813 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 02:49:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-10-14 02:49:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 548. [2024-10-14 02:49:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 411 states have (on average 1.6447688564476886) internal successors, (676), 429 states have internal predecessors, (676), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-14 02:49:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 893 transitions. [2024-10-14 02:49:17,763 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 893 transitions. Word has length 63 [2024-10-14 02:49:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:17,763 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 893 transitions. [2024-10-14 02:49:17,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:49:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 893 transitions. [2024-10-14 02:49:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 02:49:17,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:17,764 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:49:17,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 02:49:17,765 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:17,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:17,765 INFO L85 PathProgramCache]: Analyzing trace with hash -550464659, now seen corresponding path program 1 times [2024-10-14 02:49:17,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:17,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201410120] [2024-10-14 02:49:17,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:17,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:18,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:18,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:18,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:49:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:18,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:18,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:49:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:18,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 02:49:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:18,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:49:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:18,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 02:49:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:49:18,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:18,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201410120] [2024-10-14 02:49:18,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201410120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:18,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:18,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 02:49:18,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500497402] [2024-10-14 02:49:18,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:18,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 02:49:18,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:18,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 02:49:18,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:49:18,287 INFO L87 Difference]: Start difference. First operand 548 states and 893 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8)