./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_spec2_product21.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_spec2_product21.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 b02d53de4cc8dbaebc187e8fa236234211af4eca5416c7869304d04f0d61a0bd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:44:48,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:44:48,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:44:48,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:44:48,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:44:48,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:44:48,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:44:48,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:44:48,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:44:48,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:44:48,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:44:48,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:44:48,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:44:48,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:44:48,115 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:44:48,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:44:48,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:44:48,116 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:44:48,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:44:48,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:44:48,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:44:48,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:44:48,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:44:48,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:44:48,122 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:44:48,122 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:44:48,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:44:48,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:44:48,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:44:48,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:44:48,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:44:48,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:44:48,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:44:48,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:44:48,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:44:48,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:44:48,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:44:48,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:44:48,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:44:48,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:44:48,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:44:48,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:44:48,126 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 -> b02d53de4cc8dbaebc187e8fa236234211af4eca5416c7869304d04f0d61a0bd [2024-10-14 02:44:48,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:44:48,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:44:48,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:44:48,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:44:48,343 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:44:48,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c [2024-10-14 02:44:49,749 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:44:50,008 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:44:50,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c [2024-10-14 02:44:50,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a10cd2aea/6d2d8c44b1cb4d3ea3f50cbd74892634/FLAG82d3cdb14 [2024-10-14 02:44:50,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a10cd2aea/6d2d8c44b1cb4d3ea3f50cbd74892634 [2024-10-14 02:44:50,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:44:50,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:44:50,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:44:50,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:44:50,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:44:50,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:44:50" (1/1) ... [2024-10-14 02:44:50,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77564f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:50, skipping insertion in model container [2024-10-14 02:44:50,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:44:50" (1/1) ... [2024-10-14 02:44:50,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:44:50,762 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_spec2_product21.cil.c[40071,40084] [2024-10-14 02:44:50,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:44:50,851 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:44:50,859 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-10-14 02:44:50,860 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [86] [2024-10-14 02:44:50,860 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [452] [2024-10-14 02:44:50,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1120] [2024-10-14 02:44:50,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1220] [2024-10-14 02:44:50,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1574] [2024-10-14 02:44:50,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1586] [2024-10-14 02:44:50,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [1706] [2024-10-14 02:44:50,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1890] [2024-10-14 02:44:50,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1899] [2024-10-14 02:44:50,933 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_spec2_product21.cil.c[40071,40084] [2024-10-14 02:44:50,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:44:50,994 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:44:50,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:50 WrapperNode [2024-10-14 02:44:50,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:44:50,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:44:50,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:44:50,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:44:51,001 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:44:50" (1/1) ... [2024-10-14 02:44:51,022 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:44:50" (1/1) ... [2024-10-14 02:44:51,071 INFO L138 Inliner]: procedures = 92, calls = 339, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 860 [2024-10-14 02:44:51,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:44:51,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:44:51,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:44:51,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:44:51,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:50" (1/1) ... [2024-10-14 02:44:51,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:50" (1/1) ... [2024-10-14 02:44:51,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:50" (1/1) ... [2024-10-14 02:44:51,154 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-14 02:44:51,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:50" (1/1) ... [2024-10-14 02:44:51,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:50" (1/1) ... [2024-10-14 02:44:51,184 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:50" (1/1) ... [2024-10-14 02:44:51,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:50" (1/1) ... [2024-10-14 02:44:51,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:50" (1/1) ... [2024-10-14 02:44:51,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:50" (1/1) ... [2024-10-14 02:44:51,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:44:51,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:44:51,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:44:51,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:44:51,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:50" (1/1) ... [2024-10-14 02:44:51,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:44:51,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:44:51,314 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:44:51,324 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:44:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:44:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-14 02:44:51,363 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-14 02:44:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-14 02:44:51,363 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-14 02:44:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-14 02:44:51,364 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-14 02:44:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-14 02:44:51,364 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-14 02:44:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-14 02:44:51,364 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-14 02:44:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 02:44:51,364 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 02:44:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 02:44:51,365 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 02:44:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-14 02:44:51,365 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-14 02:44:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-14 02:44:51,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-14 02:44:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-14 02:44:51,365 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-14 02:44:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-14 02:44:51,365 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-14 02:44:51,366 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-14 02:44:51,366 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-14 02:44:51,366 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-14 02:44:51,366 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-14 02:44:51,366 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-14 02:44:51,366 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-14 02:44:51,366 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-14 02:44:51,366 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-14 02:44:51,366 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-14 02:44:51,367 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-14 02:44:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-14 02:44:51,367 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-14 02:44:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-14 02:44:51,367 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-14 02:44:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:44:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 02:44:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 02:44:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 02:44:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 02:44:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 02:44:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 02:44:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 02:44:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 02:44:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 02:44:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 02:44:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 02:44:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 02:44:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 02:44:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 02:44:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-14 02:44:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-14 02:44:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-14 02:44:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-14 02:44:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-14 02:44:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-14 02:44:51,369 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-14 02:44:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-14 02:44:51,369 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-14 02:44:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-14 02:44:51,369 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-14 02:44:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-14 02:44:51,370 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-14 02:44:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2024-10-14 02:44:51,370 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2024-10-14 02:44:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:44:51,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:44:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-14 02:44:51,370 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-14 02:44:51,640 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:44:51,646 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:44:52,694 INFO L? ?]: Removed 448 outVars from TransFormulas that were not future-live. [2024-10-14 02:44:52,694 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:44:52,758 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:44:52,762 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:44:52,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:44:52 BoogieIcfgContainer [2024-10-14 02:44:52,763 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:44:52,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:44:52,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:44:52,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:44:52,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:44:50" (1/3) ... [2024-10-14 02:44:52,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329d8c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:44:52, skipping insertion in model container [2024-10-14 02:44:52,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:50" (2/3) ... [2024-10-14 02:44:52,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329d8c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:44:52, skipping insertion in model container [2024-10-14 02:44:52,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:44:52" (3/3) ... [2024-10-14 02:44:52,771 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product21.cil.c [2024-10-14 02:44:52,789 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:44:52,789 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:44:52,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:44:52,861 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;@743173c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:44:52,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:44:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 542 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 442 states have internal predecessors, (728), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-14 02:44:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 02:44:52,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:44:52,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:44:52,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:44:52,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:44:52,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1538400726, now seen corresponding path program 1 times [2024-10-14 02:44:52,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:44:52,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347008584] [2024-10-14 02:44:52,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:44:52,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:44:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:44:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:44:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:44:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:44:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:44:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:44:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:44:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:44:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:44:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:44:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:44:54,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:44:54,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347008584] [2024-10-14 02:44:54,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347008584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:44:54,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:44:54,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:44:54,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920225985] [2024-10-14 02:44:54,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:44:54,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:44:54,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:44:54,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:44:54,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:44:54,031 INFO L87 Difference]: Start difference. First operand has 542 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 442 states have internal predecessors, (728), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:44:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:44:59,250 INFO L93 Difference]: Finished difference Result 1320 states and 2268 transitions. [2024-10-14 02:44:59,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:44:59,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 79 [2024-10-14 02:44:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:44:59,273 INFO L225 Difference]: With dead ends: 1320 [2024-10-14 02:44:59,274 INFO L226 Difference]: Without dead ends: 787 [2024-10-14 02:44:59,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:44:59,284 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 1404 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 2844 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 3196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 2844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:44:59,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1669 Invalid, 3196 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [352 Valid, 2844 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-14 02:44:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-10-14 02:44:59,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 538. [2024-10-14 02:44:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 419 states have (on average 1.7183770883054892) internal successors, (720), 438 states have internal predecessors, (720), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 02:44:59,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 905 transitions. [2024-10-14 02:44:59,473 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 905 transitions. Word has length 79 [2024-10-14 02:44:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:44:59,473 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 905 transitions. [2024-10-14 02:44:59,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:44:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 905 transitions. [2024-10-14 02:44:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 02:44:59,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:44:59,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:44:59,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:44:59,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:44:59,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:44:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash 464240010, now seen corresponding path program 1 times [2024-10-14 02:44:59,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:44:59,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139972907] [2024-10-14 02:44:59,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:44:59,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:44:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:59,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:44:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:59,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:44:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:59,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:44:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:00,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:45:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:00,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:00,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:00,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:45:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:00,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:45:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:00,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:45:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:00,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:45:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:00,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:00,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139972907] [2024-10-14 02:45:00,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139972907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:00,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:00,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:45:00,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289604402] [2024-10-14 02:45:00,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:00,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:45:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:00,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:45:00,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:45:00,153 INFO L87 Difference]: Start difference. First operand 538 states and 905 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:45:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:05,305 INFO L93 Difference]: Finished difference Result 1313 states and 2237 transitions. [2024-10-14 02:45:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:45:05,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 81 [2024-10-14 02:45:05,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:05,311 INFO L225 Difference]: With dead ends: 1313 [2024-10-14 02:45:05,311 INFO L226 Difference]: Without dead ends: 787 [2024-10-14 02:45:05,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:45:05,314 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 956 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 3015 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 3219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 3015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:05,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1723 Invalid, 3219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 3015 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-14 02:45:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-10-14 02:45:05,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 538. [2024-10-14 02:45:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 419 states have (on average 1.7159904534606205) internal successors, (719), 438 states have internal predecessors, (719), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 02:45:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 904 transitions. [2024-10-14 02:45:05,479 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 904 transitions. Word has length 81 [2024-10-14 02:45:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:05,479 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 904 transitions. [2024-10-14 02:45:05,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:45:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 904 transitions. [2024-10-14 02:45:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 02:45:05,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:05,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:45:05,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:45:05,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:05,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1282449535, now seen corresponding path program 1 times [2024-10-14 02:45:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:05,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249002614] [2024-10-14 02:45:05,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:05,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:05,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:05,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:45:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:06,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 02:45:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:06,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:06,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:06,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:45:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:06,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:45:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:06,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:45:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:06,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:45:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:06,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:06,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249002614] [2024-10-14 02:45:06,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249002614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:06,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:06,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:45:06,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191832270] [2024-10-14 02:45:06,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:06,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:45:06,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:06,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:45:06,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:45:06,108 INFO L87 Difference]: Start difference. First operand 538 states and 904 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:45:11,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:11,289 INFO L93 Difference]: Finished difference Result 1313 states and 2236 transitions. [2024-10-14 02:45:11,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:45:11,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2024-10-14 02:45:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:11,296 INFO L225 Difference]: With dead ends: 1313 [2024-10-14 02:45:11,296 INFO L226 Difference]: Without dead ends: 787 [2024-10-14 02:45:11,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:45:11,301 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 1392 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 2923 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 2923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:11,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1659 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 2923 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-14 02:45:11,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-10-14 02:45:11,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 538. [2024-10-14 02:45:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 419 states have (on average 1.7136038186157518) internal successors, (718), 438 states have internal predecessors, (718), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 02:45:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 903 transitions. [2024-10-14 02:45:11,426 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 903 transitions. Word has length 82 [2024-10-14 02:45:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:11,426 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 903 transitions. [2024-10-14 02:45:11,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:45:11,427 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 903 transitions. [2024-10-14 02:45:11,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 02:45:11,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:11,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:45:11,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 02:45:11,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:11,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:11,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2115772186, now seen corresponding path program 1 times [2024-10-14 02:45:11,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:11,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188288522] [2024-10-14 02:45:11,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:11,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:11,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:11,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:11,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 02:45:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:11,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:45:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:11,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:11,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:11,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:45:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:11,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:45:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:12,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:45:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:12,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:45:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:12,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:12,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188288522] [2024-10-14 02:45:12,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188288522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:12,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:12,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:45:12,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983448760] [2024-10-14 02:45:12,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:12,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:45:12,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:12,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:45:12,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:45:12,017 INFO L87 Difference]: Start difference. First operand 538 states and 903 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:45:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:16,868 INFO L93 Difference]: Finished difference Result 1313 states and 2235 transitions. [2024-10-14 02:45:16,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:45:16,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 83 [2024-10-14 02:45:16,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:16,873 INFO L225 Difference]: With dead ends: 1313 [2024-10-14 02:45:16,873 INFO L226 Difference]: Without dead ends: 787 [2024-10-14 02:45:16,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:45:16,876 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 1385 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 2927 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 2927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:16,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 1679 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 2927 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-14 02:45:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-10-14 02:45:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 538. [2024-10-14 02:45:16,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 419 states have (on average 1.7112171837708832) internal successors, (717), 438 states have internal predecessors, (717), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 02:45:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 902 transitions. [2024-10-14 02:45:16,988 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 902 transitions. Word has length 83 [2024-10-14 02:45:16,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:16,988 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 902 transitions. [2024-10-14 02:45:16,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:45:16,988 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 902 transitions. [2024-10-14 02:45:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 02:45:16,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:16,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:45:16,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 02:45:16,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:16,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:16,991 INFO L85 PathProgramCache]: Analyzing trace with hash -404524899, now seen corresponding path program 1 times [2024-10-14 02:45:16,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:16,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802422263] [2024-10-14 02:45:16,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:16,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:17,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:17,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:17,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 02:45:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:17,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 02:45:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:17,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:17,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:17,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:45:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:17,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:45:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:17,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:45:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:45:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:17,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:17,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802422263] [2024-10-14 02:45:17,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802422263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:17,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:17,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:45:17,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430230617] [2024-10-14 02:45:17,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:17,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:45:17,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:17,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:45:17,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:45:17,627 INFO L87 Difference]: Start difference. First operand 538 states and 902 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:45:22,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:22,292 INFO L93 Difference]: Finished difference Result 1313 states and 2234 transitions. [2024-10-14 02:45:22,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:45:22,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2024-10-14 02:45:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:22,300 INFO L225 Difference]: With dead ends: 1313 [2024-10-14 02:45:22,303 INFO L226 Difference]: Without dead ends: 787 [2024-10-14 02:45:22,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:45:22,305 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 948 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 3022 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 3225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 3022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:22,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 1732 Invalid, 3225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 3022 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 02:45:22,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-10-14 02:45:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 538. [2024-10-14 02:45:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 419 states have (on average 1.7088305489260143) internal successors, (716), 438 states have internal predecessors, (716), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 02:45:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 901 transitions. [2024-10-14 02:45:22,482 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 901 transitions. Word has length 84 [2024-10-14 02:45:22,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:22,483 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 901 transitions. [2024-10-14 02:45:22,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:45:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 901 transitions. [2024-10-14 02:45:22,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 02:45:22,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:22,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:45:22,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:45:22,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:22,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:22,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1415988158, now seen corresponding path program 1 times [2024-10-14 02:45:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:22,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102137359] [2024-10-14 02:45:22,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:22,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:22,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:22,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:22,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:22,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 02:45:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:23,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:23,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:23,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:45:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:23,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:45:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:23,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:45:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:23,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:45:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:23,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:23,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102137359] [2024-10-14 02:45:23,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102137359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:23,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:23,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 02:45:23,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82397607] [2024-10-14 02:45:23,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:23,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 02:45:23,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:23,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 02:45:23,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:45:23,219 INFO L87 Difference]: Start difference. First operand 538 states and 901 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:45:30,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:30,482 INFO L93 Difference]: Finished difference Result 1292 states and 2195 transitions. [2024-10-14 02:45:30,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 02:45:30,483 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 85 [2024-10-14 02:45:30,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:30,487 INFO L225 Difference]: With dead ends: 1292 [2024-10-14 02:45:30,487 INFO L226 Difference]: Without dead ends: 806 [2024-10-14 02:45:30,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2024-10-14 02:45:30,489 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 1919 mSDsluCounter, 3750 mSDsCounter, 0 mSdLazyCounter, 7600 mSolverCounterSat, 529 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2003 SdHoareTripleChecker+Valid, 4196 SdHoareTripleChecker+Invalid, 8129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 529 IncrementalHoareTripleChecker+Valid, 7600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:30,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2003 Valid, 4196 Invalid, 8129 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [529 Valid, 7600 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-14 02:45:30,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-10-14 02:45:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 545. [2024-10-14 02:45:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 424 states have (on average 1.6886792452830188) internal successors, (716), 443 states have internal predecessors, (716), 95 states have call successors, (95), 24 states have call predecessors, (95), 25 states have return successors, (95), 90 states have call predecessors, (95), 90 states have call successors, (95) [2024-10-14 02:45:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 906 transitions. [2024-10-14 02:45:30,571 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 906 transitions. Word has length 85 [2024-10-14 02:45:30,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:30,571 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 906 transitions. [2024-10-14 02:45:30,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:45:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 906 transitions. [2024-10-14 02:45:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 02:45:30,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:30,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:45:30,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:45:30,574 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:30,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash 813642905, now seen corresponding path program 1 times [2024-10-14 02:45:30,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:30,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708727279] [2024-10-14 02:45:30,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:30,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:30,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:30,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:30,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:31,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:45:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:31,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:31,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:31,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:45:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:31,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 02:45:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:31,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:45:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:31,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 02:45:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:31,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:31,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708727279] [2024-10-14 02:45:31,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708727279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:31,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:31,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 02:45:31,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243895350] [2024-10-14 02:45:31,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:31,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 02:45:31,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:31,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 02:45:31,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:45:31,452 INFO L87 Difference]: Start difference. First operand 545 states and 906 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:45:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:38,052 INFO L93 Difference]: Finished difference Result 1306 states and 2210 transitions. [2024-10-14 02:45:38,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 02:45:38,053 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 87 [2024-10-14 02:45:38,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:38,059 INFO L225 Difference]: With dead ends: 1306 [2024-10-14 02:45:38,059 INFO L226 Difference]: Without dead ends: 813 [2024-10-14 02:45:38,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-10-14 02:45:38,061 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 1466 mSDsluCounter, 3394 mSDsCounter, 0 mSdLazyCounter, 6827 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 3844 SdHoareTripleChecker+Invalid, 7193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 6827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:38,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 3844 Invalid, 7193 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [366 Valid, 6827 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-14 02:45:38,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-10-14 02:45:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 546. [2024-10-14 02:45:38,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 425 states have (on average 1.6752941176470588) internal successors, (712), 443 states have internal predecessors, (712), 95 states have call successors, (95), 24 states have call predecessors, (95), 25 states have return successors, (95), 91 states have call predecessors, (95), 90 states have call successors, (95) [2024-10-14 02:45:38,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 902 transitions. [2024-10-14 02:45:38,141 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 902 transitions. Word has length 87 [2024-10-14 02:45:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:38,144 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 902 transitions. [2024-10-14 02:45:38,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:45:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 902 transitions. [2024-10-14 02:45:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 02:45:38,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:38,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:45:38,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:45:38,147 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:38,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:38,147 INFO L85 PathProgramCache]: Analyzing trace with hash -477794145, now seen corresponding path program 1 times [2024-10-14 02:45:38,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:38,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693485546] [2024-10-14 02:45:38,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:38,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:38,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:38,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:38,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:38,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:45:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:38,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:38,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:38,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:45:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:38,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 02:45:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:38,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:45:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:38,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 02:45:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:38,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:38,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:38,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693485546] [2024-10-14 02:45:38,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693485546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:38,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:38,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:45:38,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650602436] [2024-10-14 02:45:38,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:38,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:45:38,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:38,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:45:38,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:45:38,961 INFO L87 Difference]: Start difference. First operand 546 states and 902 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:45:44,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:44,435 INFO L93 Difference]: Finished difference Result 1311 states and 2219 transitions. [2024-10-14 02:45:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 02:45:44,436 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2024-10-14 02:45:44,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:44,442 INFO L225 Difference]: With dead ends: 1311 [2024-10-14 02:45:44,442 INFO L226 Difference]: Without dead ends: 817 [2024-10-14 02:45:44,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-14 02:45:44,445 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 1018 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 4529 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 4747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 4529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:44,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 2616 Invalid, 4747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 4529 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 02:45:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2024-10-14 02:45:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 549. [2024-10-14 02:45:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 428 states have (on average 1.661214953271028) internal successors, (711), 446 states have internal predecessors, (711), 95 states have call successors, (95), 24 states have call predecessors, (95), 25 states have return successors, (95), 91 states have call predecessors, (95), 90 states have call successors, (95) [2024-10-14 02:45:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 901 transitions. [2024-10-14 02:45:44,685 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 901 transitions. Word has length 88 [2024-10-14 02:45:44,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:44,685 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 901 transitions. [2024-10-14 02:45:44,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:45:44,686 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 901 transitions. [2024-10-14 02:45:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 02:45:44,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:44,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:45:44,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:45:44,693 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:44,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:44,694 INFO L85 PathProgramCache]: Analyzing trace with hash 412342826, now seen corresponding path program 1 times [2024-10-14 02:45:44,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:44,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897094961] [2024-10-14 02:45:44,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:44,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:45,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:45,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:45,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:45,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:45:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:45,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:45,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:45,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:45:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:45,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:45:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:45,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 02:45:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:45,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:45:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:45,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:45,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897094961] [2024-10-14 02:45:45,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897094961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:45,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:45,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 02:45:45,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881302110] [2024-10-14 02:45:45,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:45,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 02:45:45,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:45,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 02:45:45,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:45:45,807 INFO L87 Difference]: Start difference. First operand 549 states and 901 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-14 02:45:58,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:58,439 INFO L93 Difference]: Finished difference Result 2520 states and 4448 transitions. [2024-10-14 02:45:58,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-14 02:45:58,440 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2024-10-14 02:45:58,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:58,454 INFO L225 Difference]: With dead ends: 2520 [2024-10-14 02:45:58,454 INFO L226 Difference]: Without dead ends: 2023 [2024-10-14 02:45:58,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=258, Invalid=734, Unknown=0, NotChecked=0, Total=992 [2024-10-14 02:45:58,460 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 5210 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 5922 mSolverCounterSat, 1711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5297 SdHoareTripleChecker+Valid, 3678 SdHoareTripleChecker+Invalid, 7633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1711 IncrementalHoareTripleChecker+Valid, 5922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:58,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5297 Valid, 3678 Invalid, 7633 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1711 Valid, 5922 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-10-14 02:45:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2024-10-14 02:45:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1466. [2024-10-14 02:45:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1130 states have (on average 1.6371681415929205) internal successors, (1850), 1174 states have internal predecessors, (1850), 264 states have call successors, (264), 65 states have call predecessors, (264), 71 states have return successors, (325), 262 states have call predecessors, (325), 259 states have call successors, (325) [2024-10-14 02:45:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2439 transitions. [2024-10-14 02:45:58,823 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2439 transitions. Word has length 92 [2024-10-14 02:45:58,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:58,824 INFO L471 AbstractCegarLoop]: Abstraction has 1466 states and 2439 transitions. [2024-10-14 02:45:58,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-14 02:45:58,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2439 transitions. [2024-10-14 02:45:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 02:45:58,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:58,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:45:58,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 02:45:58,828 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:58,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:58,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2086786657, now seen corresponding path program 1 times [2024-10-14 02:45:58,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:58,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884227655] [2024-10-14 02:45:58,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:58,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:59,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:59,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:59,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:59,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:45:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:59,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:59,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:59,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:45:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:59,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:45:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:59,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:45:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:59,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:45:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:59,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:59,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884227655] [2024-10-14 02:45:59,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884227655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:59,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:59,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:45:59,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285686752] [2024-10-14 02:45:59,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:59,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:45:59,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:59,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:45:59,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:45:59,512 INFO L87 Difference]: Start difference. First operand 1466 states and 2439 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:46:06,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:46:06,043 INFO L93 Difference]: Finished difference Result 3397 states and 5803 transitions. [2024-10-14 02:46:06,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 02:46:06,043 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-10-14 02:46:06,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:46:06,058 INFO L225 Difference]: With dead ends: 3397 [2024-10-14 02:46:06,059 INFO L226 Difference]: Without dead ends: 1989 [2024-10-14 02:46:06,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-10-14 02:46:06,067 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 980 mSDsluCounter, 2550 mSDsCounter, 0 mSdLazyCounter, 5136 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 2993 SdHoareTripleChecker+Invalid, 5346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 5136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:46:06,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 2993 Invalid, 5346 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [210 Valid, 5136 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-14 02:46:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2024-10-14 02:46:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1477. [2024-10-14 02:46:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1141 states have (on average 1.63102541630149) internal successors, (1861), 1185 states have internal predecessors, (1861), 264 states have call successors, (264), 65 states have call predecessors, (264), 71 states have return successors, (325), 262 states have call predecessors, (325), 259 states have call successors, (325) [2024-10-14 02:46:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 2450 transitions. [2024-10-14 02:46:06,537 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 2450 transitions. Word has length 93 [2024-10-14 02:46:06,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:46:06,537 INFO L471 AbstractCegarLoop]: Abstraction has 1477 states and 2450 transitions. [2024-10-14 02:46:06,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:46:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 2450 transitions. [2024-10-14 02:46:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 02:46:06,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:46:06,541 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:06,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 02:46:06,542 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:46:06,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:46:06,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1027910619, now seen corresponding path program 1 times [2024-10-14 02:46:06,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:46:06,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989875634] [2024-10-14 02:46:06,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:46:06,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:46:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:06,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:06,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:06,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:46:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:07,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:46:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:07,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:07,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:07,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:46:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:07,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:46:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:07,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:46:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:07,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:46:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:07,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:46:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:07,131 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:46:07,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:46:07,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989875634] [2024-10-14 02:46:07,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989875634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:46:07,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:46:07,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:46:07,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271385688] [2024-10-14 02:46:07,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:46:07,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:46:07,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:46:07,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:46:07,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:46:07,133 INFO L87 Difference]: Start difference. First operand 1477 states and 2450 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:46:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:46:11,553 INFO L93 Difference]: Finished difference Result 3424 states and 5815 transitions. [2024-10-14 02:46:11,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:46:11,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2024-10-14 02:46:11,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:46:11,565 INFO L225 Difference]: With dead ends: 3424 [2024-10-14 02:46:11,565 INFO L226 Difference]: Without dead ends: 1999 [2024-10-14 02:46:11,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:46:11,569 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 1894 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1974 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 3148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:46:11,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1974 Valid, 1599 Invalid, 3148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 2635 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-14 02:46:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2024-10-14 02:46:11,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1477. [2024-10-14 02:46:11,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1141 states have (on average 1.626643295354952) internal successors, (1856), 1185 states have internal predecessors, (1856), 264 states have call successors, (264), 65 states have call predecessors, (264), 71 states have return successors, (325), 262 states have call predecessors, (325), 259 states have call successors, (325) [2024-10-14 02:46:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 2445 transitions. [2024-10-14 02:46:11,893 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 2445 transitions. Word has length 96 [2024-10-14 02:46:11,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:46:11,893 INFO L471 AbstractCegarLoop]: Abstraction has 1477 states and 2445 transitions. [2024-10-14 02:46:11,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:46:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 2445 transitions. [2024-10-14 02:46:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 02:46:11,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:46:11,896 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:11,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 02:46:11,896 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:46:11,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:46:11,896 INFO L85 PathProgramCache]: Analyzing trace with hash 12009352, now seen corresponding path program 1 times [2024-10-14 02:46:11,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:46:11,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909187711] [2024-10-14 02:46:11,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:46:11,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:46:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:12,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:12,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:12,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:46:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:12,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:46:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:12,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:12,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:12,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:46:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:12,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:46:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:12,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:46:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:12,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:46:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:12,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:46:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:12,520 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:46:12,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:46:12,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909187711] [2024-10-14 02:46:12,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909187711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:46:12,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:46:12,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:46:12,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72686399] [2024-10-14 02:46:12,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:46:12,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:46:12,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:46:12,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:46:12,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:46:12,522 INFO L87 Difference]: Start difference. First operand 1477 states and 2445 transitions. Second operand has 10 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 02:46:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:46:18,551 INFO L93 Difference]: Finished difference Result 3420 states and 5802 transitions. [2024-10-14 02:46:18,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:46:18,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2024-10-14 02:46:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:46:18,569 INFO L225 Difference]: With dead ends: 3420 [2024-10-14 02:46:18,569 INFO L226 Difference]: Without dead ends: 2003 [2024-10-14 02:46:18,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-14 02:46:18,578 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 1860 mSDsluCounter, 2462 mSDsCounter, 0 mSdLazyCounter, 4916 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1941 SdHoareTripleChecker+Valid, 2911 SdHoareTripleChecker+Invalid, 5430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 4916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:46:18,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1941 Valid, 2911 Invalid, 5430 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [514 Valid, 4916 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-14 02:46:18,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2024-10-14 02:46:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1480. [2024-10-14 02:46:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1144 states have (on average 1.625) internal successors, (1859), 1188 states have internal predecessors, (1859), 264 states have call successors, (264), 65 states have call predecessors, (264), 71 states have return successors, (325), 262 states have call predecessors, (325), 259 states have call successors, (325) [2024-10-14 02:46:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2448 transitions. [2024-10-14 02:46:19,129 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2448 transitions. Word has length 96 [2024-10-14 02:46:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:46:19,129 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 2448 transitions. [2024-10-14 02:46:19,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 02:46:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2448 transitions. [2024-10-14 02:46:19,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 02:46:19,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:46:19,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:19,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 02:46:19,141 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:46:19,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:46:19,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2065938822, now seen corresponding path program 1 times [2024-10-14 02:46:19,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:46:19,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776066178] [2024-10-14 02:46:19,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:46:19,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:46:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:19,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:19,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:46:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:46:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:46:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:46:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:46:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:46:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:46:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,282 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:46:20,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:46:20,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776066178] [2024-10-14 02:46:20,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776066178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:46:20,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:46:20,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:46:20,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914383434] [2024-10-14 02:46:20,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:46:20,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:46:20,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:46:20,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:46:20,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:46:20,285 INFO L87 Difference]: Start difference. First operand 1480 states and 2448 transitions. Second operand has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)