./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_product20.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_product20.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 e1240a0d3e559b8971965b03cecb352351a22be921567ab044722f9bb2872bc1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:16:38,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:16:38,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:16:38,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:16:38,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:16:38,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:16:38,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:16:38,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:16:38,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:16:38,121 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:16:38,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:16:38,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:16:38,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:16:38,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:16:38,124 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:16:38,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:16:38,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:16:38,127 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:16:38,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:16:38,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:16:38,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:16:38,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:16:38,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:16:38,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:16:38,131 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:16:38,131 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:16:38,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:16:38,132 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:16:38,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:16:38,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:16:38,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:16:38,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:16:38,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:16:38,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:16:38,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:16:38,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:16:38,134 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:16:38,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:16:38,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:16:38,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:16:38,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:16:38,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:16:38,136 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 -> e1240a0d3e559b8971965b03cecb352351a22be921567ab044722f9bb2872bc1 [2024-10-12 19:16:38,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:16:38,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:16:38,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:16:38,429 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:16:38,430 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:16:38,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product20.cil.c [2024-10-12 19:16:39,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:16:40,191 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:16:40,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product20.cil.c [2024-10-12 19:16:40,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38054539/bb2503a3f83142309c221eaeb7622722/FLAG0a16bec46 [2024-10-12 19:16:40,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38054539/bb2503a3f83142309c221eaeb7622722 [2024-10-12 19:16:40,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:16:40,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:16:40,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:16:40,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:16:40,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:16:40,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:16:40" (1/1) ... [2024-10-12 19:16:40,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32310ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:40, skipping insertion in model container [2024-10-12 19:16:40,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:16:40" (1/1) ... [2024-10-12 19:16:40,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:16:40,918 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_product20.cil.c[38445,38458] [2024-10-12 19:16:41,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:16:41,079 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:16:41,088 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [48] [2024-10-12 19:16:41,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [236] [2024-10-12 19:16:41,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1824] [2024-10-12 19:16:41,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1833] [2024-10-12 19:16:41,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2199] [2024-10-12 19:16:41,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2861] [2024-10-12 19:16:41,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2875] [2024-10-12 19:16:41,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2913] [2024-10-12 19:16:41,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3006] [2024-10-12 19:16:41,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3356] [2024-10-12 19:16:41,163 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_product20.cil.c[38445,38458] [2024-10-12 19:16:41,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:16:41,243 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:16:41,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:41 WrapperNode [2024-10-12 19:16:41,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:16:41,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:16:41,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:16:41,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:16:41,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:41" (1/1) ... [2024-10-12 19:16:41,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:41" (1/1) ... [2024-10-12 19:16:41,327 INFO L138 Inliner]: procedures = 96, calls = 346, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 1133 [2024-10-12 19:16:41,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:16:41,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:16:41,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:16:41,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:16:41,340 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:41" (1/1) ... [2024-10-12 19:16:41,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:41" (1/1) ... [2024-10-12 19:16:41,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:41" (1/1) ... [2024-10-12 19:16:41,391 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-12 19:16:41,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:41" (1/1) ... [2024-10-12 19:16:41,392 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:41" (1/1) ... [2024-10-12 19:16:41,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:41" (1/1) ... [2024-10-12 19:16:41,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:41" (1/1) ... [2024-10-12 19:16:41,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:41" (1/1) ... [2024-10-12 19:16:41,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:41" (1/1) ... [2024-10-12 19:16:41,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:16:41,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:16:41,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:16:41,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:16:41,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:41" (1/1) ... [2024-10-12 19:16:41,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:16:41,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:16:41,495 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-12 19:16:41,498 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-12 19:16:41,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:16:41,544 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-12 19:16:41,544 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-12 19:16:41,544 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-12 19:16:41,544 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-12 19:16:41,544 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2024-10-12 19:16:41,544 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2024-10-12 19:16:41,544 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-12 19:16:41,545 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-12 19:16:41,546 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-12 19:16:41,546 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-12 19:16:41,546 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-12 19:16:41,546 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-12 19:16:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-12 19:16:41,547 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-12 19:16:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:16:41,548 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:16:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:16:41,548 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:16:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-12 19:16:41,548 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-12 19:16:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-12 19:16:41,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-12 19:16:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-12 19:16:41,550 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-12 19:16:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-12 19:16:41,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-12 19:16:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-12 19:16:41,550 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-12 19:16:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-12 19:16:41,551 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-12 19:16:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-12 19:16:41,551 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-12 19:16:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-12 19:16:41,551 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-12 19:16:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-12 19:16:41,551 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-12 19:16:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-12 19:16:41,552 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-12 19:16:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-12 19:16:41,552 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-12 19:16:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:16:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:16:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:16:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:16:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 19:16:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 19:16:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 19:16:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-12 19:16:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-12 19:16:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-12 19:16:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-12 19:16:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-12 19:16:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-12 19:16:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-12 19:16:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-12 19:16:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-12 19:16:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-12 19:16:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-12 19:16:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-12 19:16:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-12 19:16:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-12 19:16:41,553 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-12 19:16:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-12 19:16:41,554 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-12 19:16:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-12 19:16:41,554 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-12 19:16:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:16:41,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:16:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-12 19:16:41,554 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-12 19:16:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-10-12 19:16:41,554 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-10-12 19:16:41,767 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:16:41,769 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:16:42,959 INFO L? ?]: Removed 451 outVars from TransFormulas that were not future-live. [2024-10-12 19:16:42,960 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:16:43,091 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:16:43,091 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:16:43,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:16:43 BoogieIcfgContainer [2024-10-12 19:16:43,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:16:43,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:16:43,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:16:43,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:16:43,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:16:40" (1/3) ... [2024-10-12 19:16:43,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6ed470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:16:43, skipping insertion in model container [2024-10-12 19:16:43,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:41" (2/3) ... [2024-10-12 19:16:43,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6ed470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:16:43, skipping insertion in model container [2024-10-12 19:16:43,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:16:43" (3/3) ... [2024-10-12 19:16:43,102 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product20.cil.c [2024-10-12 19:16:43,117 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:16:43,118 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:16:43,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:16:43,212 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;@3a565474, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:16:43,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:16:43,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 547 states, 421 states have (on average 1.7220902612826603) internal successors, (725), 444 states have internal predecessors, (725), 99 states have call successors, (99), 25 states have call predecessors, (99), 25 states have return successors, (99), 92 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-12 19:16:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 19:16:43,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:16:43,239 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] [2024-10-12 19:16:43,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:16:43,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:16:43,246 INFO L85 PathProgramCache]: Analyzing trace with hash -255245996, now seen corresponding path program 1 times [2024-10-12 19:16:43,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:16:43,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979888493] [2024-10-12 19:16:43,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:16:43,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:16:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:43,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:16:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:43,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:43,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:16:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:44,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:16:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:44,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:44,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:44,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:16:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:44,476 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-12 19:16:44,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:16:44,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979888493] [2024-10-12 19:16:44,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979888493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:16:44,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:16:44,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:16:44,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801538997] [2024-10-12 19:16:44,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:16:44,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:16:44,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:16:44,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:16:44,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:16:44,520 INFO L87 Difference]: Start difference. First operand has 547 states, 421 states have (on average 1.7220902612826603) internal successors, (725), 444 states have internal predecessors, (725), 99 states have call successors, (99), 25 states have call predecessors, (99), 25 states have return successors, (99), 92 states have call predecessors, (99), 99 states have call successors, (99) Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:16:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:16:49,667 INFO L93 Difference]: Finished difference Result 1239 states and 2117 transitions. [2024-10-12 19:16:49,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:16:49,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2024-10-12 19:16:49,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:16:49,688 INFO L225 Difference]: With dead ends: 1239 [2024-10-12 19:16:49,689 INFO L226 Difference]: Without dead ends: 701 [2024-10-12 19:16:49,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:16:49,701 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 674 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 2746 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 2872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:16:49,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1074 Invalid, 2872 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [126 Valid, 2746 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-12 19:16:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-12 19:16:49,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 543. [2024-10-12 19:16:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 419 states have (on average 1.7112171837708832) internal successors, (717), 440 states have internal predecessors, (717), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:16:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 910 transitions. [2024-10-12 19:16:49,916 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 910 transitions. Word has length 50 [2024-10-12 19:16:49,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:16:49,917 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 910 transitions. [2024-10-12 19:16:49,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:16:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 910 transitions. [2024-10-12 19:16:49,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 19:16:49,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:16:49,923 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] [2024-10-12 19:16:49,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:16:49,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:16:49,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:16:49,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1426460899, now seen corresponding path program 1 times [2024-10-12 19:16:49,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:16:49,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501447513] [2024-10-12 19:16:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:16:49,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:16:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:50,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:16:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:50,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:50,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:16:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:50,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:16:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:50,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:50,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:50,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:16:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:50,589 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-12 19:16:50,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:16:50,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501447513] [2024-10-12 19:16:50,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501447513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:16:50,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:16:50,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:16:50,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554693314] [2024-10-12 19:16:50,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:16:50,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:16:50,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:16:50,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:16:50,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:16:50,592 INFO L87 Difference]: Start difference. First operand 543 states and 910 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:16:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:16:55,299 INFO L93 Difference]: Finished difference Result 1232 states and 2090 transitions. [2024-10-12 19:16:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:16:55,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2024-10-12 19:16:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:16:55,310 INFO L225 Difference]: With dead ends: 1232 [2024-10-12 19:16:55,310 INFO L226 Difference]: Without dead ends: 701 [2024-10-12 19:16:55,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:16:55,316 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 673 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 2732 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:16:55,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1062 Invalid, 2857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2732 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-12 19:16:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-12 19:16:55,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 543. [2024-10-12 19:16:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 419 states have (on average 1.7088305489260143) internal successors, (716), 440 states have internal predecessors, (716), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:16:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 909 transitions. [2024-10-12 19:16:55,439 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 909 transitions. Word has length 52 [2024-10-12 19:16:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:16:55,439 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 909 transitions. [2024-10-12 19:16:55,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:16:55,440 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 909 transitions. [2024-10-12 19:16:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 19:16:55,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:16:55,442 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] [2024-10-12 19:16:55,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:16:55,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:16:55,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:16:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1923621859, now seen corresponding path program 1 times [2024-10-12 19:16:55,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:16:55,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288693113] [2024-10-12 19:16:55,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:16:55,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:16:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:55,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:16:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:55,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:55,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:16:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:55,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 19:16:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:56,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:56,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:56,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:16:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:56,066 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-12 19:16:56,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:16:56,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288693113] [2024-10-12 19:16:56,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288693113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:16:56,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:16:56,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:16:56,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637813603] [2024-10-12 19:16:56,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:16:56,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:16:56,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:16:56,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:16:56,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:16:56,071 INFO L87 Difference]: Start difference. First operand 543 states and 909 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:00,057 INFO L93 Difference]: Finished difference Result 1232 states and 2089 transitions. [2024-10-12 19:17:00,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:00,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2024-10-12 19:17:00,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:00,063 INFO L225 Difference]: With dead ends: 1232 [2024-10-12 19:17:00,063 INFO L226 Difference]: Without dead ends: 701 [2024-10-12 19:17:00,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:00,067 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 671 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 2732 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:00,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1086 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2732 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-12 19:17:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-12 19:17:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 543. [2024-10-12 19:17:00,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 419 states have (on average 1.7064439140811456) internal successors, (715), 440 states have internal predecessors, (715), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:17:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 908 transitions. [2024-10-12 19:17:00,146 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 908 transitions. Word has length 53 [2024-10-12 19:17:00,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:00,147 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 908 transitions. [2024-10-12 19:17:00,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 908 transitions. [2024-10-12 19:17:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 19:17:00,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:00,149 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] [2024-10-12 19:17:00,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:17:00,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:00,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:00,150 INFO L85 PathProgramCache]: Analyzing trace with hash -909999577, now seen corresponding path program 1 times [2024-10-12 19:17:00,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:00,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848558572] [2024-10-12 19:17:00,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:00,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:00,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:00,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:00,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:17:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:00,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:17:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:00,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:00,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:00,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:00,745 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-12 19:17:00,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:00,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848558572] [2024-10-12 19:17:00,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848558572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:00,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:00,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:00,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297135041] [2024-10-12 19:17:00,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:00,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:00,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:00,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:00,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:00,749 INFO L87 Difference]: Start difference. First operand 543 states and 908 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:04,672 INFO L93 Difference]: Finished difference Result 1232 states and 2088 transitions. [2024-10-12 19:17:04,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:04,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-10-12 19:17:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:04,677 INFO L225 Difference]: With dead ends: 1232 [2024-10-12 19:17:04,677 INFO L226 Difference]: Without dead ends: 701 [2024-10-12 19:17:04,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:04,680 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 668 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 2731 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:04,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1092 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2731 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 19:17:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-12 19:17:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 543. [2024-10-12 19:17:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 419 states have (on average 1.704057279236277) internal successors, (714), 440 states have internal predecessors, (714), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:17:04,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 907 transitions. [2024-10-12 19:17:04,757 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 907 transitions. Word has length 54 [2024-10-12 19:17:04,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:04,757 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 907 transitions. [2024-10-12 19:17:04,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:04,758 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 907 transitions. [2024-10-12 19:17:04,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 19:17:04,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:04,759 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] [2024-10-12 19:17:04,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:17:04,759 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:04,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:04,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2060474527, now seen corresponding path program 1 times [2024-10-12 19:17:04,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:04,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249978882] [2024-10-12 19:17:04,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:04,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:04,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:04,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:04,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:17:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:05,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:17:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:05,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:05,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:05,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:05,262 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-12 19:17:05,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:05,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249978882] [2024-10-12 19:17:05,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249978882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:05,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:05,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:05,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049681989] [2024-10-12 19:17:05,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:05,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:05,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:05,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:05,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:05,264 INFO L87 Difference]: Start difference. First operand 543 states and 907 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:09,167 INFO L93 Difference]: Finished difference Result 1232 states and 2087 transitions. [2024-10-12 19:17:09,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:09,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 55 [2024-10-12 19:17:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:09,173 INFO L225 Difference]: With dead ends: 1232 [2024-10-12 19:17:09,174 INFO L226 Difference]: Without dead ends: 701 [2024-10-12 19:17:09,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:09,177 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 666 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 2726 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 2851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:09,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1071 Invalid, 2851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2726 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 19:17:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-12 19:17:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 543. [2024-10-12 19:17:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 419 states have (on average 1.701670644391408) internal successors, (713), 440 states have internal predecessors, (713), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:17:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 906 transitions. [2024-10-12 19:17:09,261 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 906 transitions. Word has length 55 [2024-10-12 19:17:09,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:09,261 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 906 transitions. [2024-10-12 19:17:09,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:09,262 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 906 transitions. [2024-10-12 19:17:09,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 19:17:09,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:09,263 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] [2024-10-12 19:17:09,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:17:09,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:09,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1578486933, now seen corresponding path program 1 times [2024-10-12 19:17:09,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:09,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518271849] [2024-10-12 19:17:09,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:09,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:09,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:09,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:09,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:09,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:17:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:09,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:09,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:09,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:09,861 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-12 19:17:09,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:09,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518271849] [2024-10-12 19:17:09,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518271849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:09,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:09,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:09,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981713252] [2024-10-12 19:17:09,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:09,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:09,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:09,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:09,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:09,864 INFO L87 Difference]: Start difference. First operand 543 states and 906 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:13,432 INFO L93 Difference]: Finished difference Result 1202 states and 2026 transitions. [2024-10-12 19:17:13,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:17:13,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2024-10-12 19:17:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:13,437 INFO L225 Difference]: With dead ends: 1202 [2024-10-12 19:17:13,437 INFO L226 Difference]: Without dead ends: 711 [2024-10-12 19:17:13,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:17:13,440 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 726 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 2694 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 2822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 2694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:13,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1086 Invalid, 2822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 2694 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 19:17:13,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-12 19:17:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 543. [2024-10-12 19:17:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 419 states have (on average 1.6897374701670644) internal successors, (708), 440 states have internal predecessors, (708), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:17:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 901 transitions. [2024-10-12 19:17:13,550 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 901 transitions. Word has length 56 [2024-10-12 19:17:13,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:13,551 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 901 transitions. [2024-10-12 19:17:13,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:13,552 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 901 transitions. [2024-10-12 19:17:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 19:17:13,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:13,555 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] [2024-10-12 19:17:13,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:17:13,555 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:13,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:13,557 INFO L85 PathProgramCache]: Analyzing trace with hash -253369053, now seen corresponding path program 1 times [2024-10-12 19:17:13,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:13,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715847584] [2024-10-12 19:17:13,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:13,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:13,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:13,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:13,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:14,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:17:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:14,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:14,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:14,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:14,068 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-12 19:17:14,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:14,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715847584] [2024-10-12 19:17:14,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715847584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:14,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:14,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:14,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269911410] [2024-10-12 19:17:14,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:14,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:14,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:14,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:14,070 INFO L87 Difference]: Start difference. First operand 543 states and 901 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:17,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:17,338 INFO L93 Difference]: Finished difference Result 1202 states and 2021 transitions. [2024-10-12 19:17:17,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:17:17,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2024-10-12 19:17:17,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:17,343 INFO L225 Difference]: With dead ends: 1202 [2024-10-12 19:17:17,343 INFO L226 Difference]: Without dead ends: 711 [2024-10-12 19:17:17,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:17:17,346 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1166 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:17,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 1084 Invalid, 2796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 19:17:17,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-12 19:17:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 543. [2024-10-12 19:17:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 419 states have (on average 1.6778042959427208) internal successors, (703), 440 states have internal predecessors, (703), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:17:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 896 transitions. [2024-10-12 19:17:17,449 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 896 transitions. Word has length 57 [2024-10-12 19:17:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:17,450 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 896 transitions. [2024-10-12 19:17:17,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 896 transitions. [2024-10-12 19:17:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 19:17:17,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:17,454 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] [2024-10-12 19:17:17,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:17:17,454 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:17,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:17,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1744664966, now seen corresponding path program 1 times [2024-10-12 19:17:17,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:17,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926900627] [2024-10-12 19:17:17,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:17,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:17,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:17,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:17,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:18,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:17:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:18,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:18,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:18,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:18,069 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-12 19:17:18,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:18,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926900627] [2024-10-12 19:17:18,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926900627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:18,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:18,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:17:18,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207058830] [2024-10-12 19:17:18,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:18,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:17:18,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:18,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:17:18,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:17:18,071 INFO L87 Difference]: Start difference. First operand 543 states and 896 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:17:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:23,279 INFO L93 Difference]: Finished difference Result 1208 states and 2026 transitions. [2024-10-12 19:17:23,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:17:23,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-12 19:17:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:23,284 INFO L225 Difference]: With dead ends: 1208 [2024-10-12 19:17:23,284 INFO L226 Difference]: Without dead ends: 725 [2024-10-12 19:17:23,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:17:23,287 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 1185 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 4744 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 5019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 4744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:23,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 1945 Invalid, 5019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 4744 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-12 19:17:23,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-10-12 19:17:23,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 555. [2024-10-12 19:17:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 428 states have (on average 1.675233644859813) internal successors, (717), 451 states have internal predecessors, (717), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-12 19:17:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 914 transitions. [2024-10-12 19:17:23,380 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 914 transitions. Word has length 58 [2024-10-12 19:17:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:23,380 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 914 transitions. [2024-10-12 19:17:23,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:17:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 914 transitions. [2024-10-12 19:17:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 19:17:23,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:23,382 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] [2024-10-12 19:17:23,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:17:23,382 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:23,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash -579362873, now seen corresponding path program 1 times [2024-10-12 19:17:23,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:23,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707160056] [2024-10-12 19:17:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:23,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:23,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:23,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:23,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:23,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:17:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:23,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:23,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:23,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:23,884 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-12 19:17:23,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:23,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707160056] [2024-10-12 19:17:23,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707160056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:23,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:23,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:23,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692018764] [2024-10-12 19:17:23,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:23,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:23,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:23,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:23,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:23,887 INFO L87 Difference]: Start difference. First operand 555 states and 914 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:27,254 INFO L93 Difference]: Finished difference Result 1230 states and 2064 transitions. [2024-10-12 19:17:27,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:17:27,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-12 19:17:27,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:27,259 INFO L225 Difference]: With dead ends: 1230 [2024-10-12 19:17:27,260 INFO L226 Difference]: Without dead ends: 731 [2024-10-12 19:17:27,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:17:27,263 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1166 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:27,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 1078 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 19:17:27,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-12 19:17:27,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 555. [2024-10-12 19:17:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 428 states have (on average 1.6635514018691588) internal successors, (712), 451 states have internal predecessors, (712), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-12 19:17:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 909 transitions. [2024-10-12 19:17:27,377 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 909 transitions. Word has length 58 [2024-10-12 19:17:27,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:27,378 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 909 transitions. [2024-10-12 19:17:27,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 909 transitions. [2024-10-12 19:17:27,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:17:27,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:27,380 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] [2024-10-12 19:17:27,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:17:27,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:27,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:27,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1955498659, now seen corresponding path program 1 times [2024-10-12 19:17:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:27,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681993643] [2024-10-12 19:17:27,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:27,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:27,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:27,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:27,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:28,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:17:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:28,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:28,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:28,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:28,040 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-12 19:17:28,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681993643] [2024-10-12 19:17:28,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681993643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:28,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:28,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:17:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251707014] [2024-10-12 19:17:28,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:28,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:17:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:28,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:17:28,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:17:28,043 INFO L87 Difference]: Start difference. First operand 555 states and 909 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:17:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:33,141 INFO L93 Difference]: Finished difference Result 1210 states and 2022 transitions. [2024-10-12 19:17:33,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:17:33,141 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-12 19:17:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:33,146 INFO L225 Difference]: With dead ends: 1210 [2024-10-12 19:17:33,146 INFO L226 Difference]: Without dead ends: 725 [2024-10-12 19:17:33,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:17:33,148 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 712 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 4851 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 4979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 4851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:33,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1889 Invalid, 4979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 4851 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-12 19:17:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-10-12 19:17:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 555. [2024-10-12 19:17:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 428 states have (on average 1.661214953271028) internal successors, (711), 451 states have internal predecessors, (711), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-12 19:17:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 908 transitions. [2024-10-12 19:17:33,241 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 908 transitions. Word has length 59 [2024-10-12 19:17:33,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:33,242 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 908 transitions. [2024-10-12 19:17:33,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:17:33,242 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 908 transitions. [2024-10-12 19:17:33,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:17:33,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:33,243 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] [2024-10-12 19:17:33,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:17:33,244 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:33,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:33,244 INFO L85 PathProgramCache]: Analyzing trace with hash -197123459, now seen corresponding path program 1 times [2024-10-12 19:17:33,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:33,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737596073] [2024-10-12 19:17:33,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:33,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:33,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:33,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:33,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:33,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:17:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:33,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:33,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:33,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:33,754 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-12 19:17:33,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:33,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737596073] [2024-10-12 19:17:33,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737596073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:33,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:33,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:33,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667942434] [2024-10-12 19:17:33,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:33,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:33,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:33,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:33,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:33,756 INFO L87 Difference]: Start difference. First operand 555 states and 908 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:37,085 INFO L93 Difference]: Finished difference Result 1230 states and 2055 transitions. [2024-10-12 19:17:37,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:17:37,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-12 19:17:37,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:37,090 INFO L225 Difference]: With dead ends: 1230 [2024-10-12 19:17:37,090 INFO L226 Difference]: Without dead ends: 731 [2024-10-12 19:17:37,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:17:37,092 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 1166 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 2758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:37,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 1065 Invalid, 2758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 19:17:37,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-12 19:17:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 555. [2024-10-12 19:17:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 428 states have (on average 1.6495327102803738) internal successors, (706), 451 states have internal predecessors, (706), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-12 19:17:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 903 transitions. [2024-10-12 19:17:37,204 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 903 transitions. Word has length 59 [2024-10-12 19:17:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:37,205 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 903 transitions. [2024-10-12 19:17:37,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:37,206 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 903 transitions. [2024-10-12 19:17:37,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 19:17:37,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:37,207 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] [2024-10-12 19:17:37,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:17:37,207 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:37,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:37,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1341574276, now seen corresponding path program 1 times [2024-10-12 19:17:37,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:37,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298818231] [2024-10-12 19:17:37,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:37,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:37,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:37,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:37,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:37,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:17:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:37,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:37,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:37,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:37,740 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-12 19:17:37,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:37,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298818231] [2024-10-12 19:17:37,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298818231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:37,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:37,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:17:37,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125295980] [2024-10-12 19:17:37,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:37,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:17:37,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:37,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:17:37,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:17:37,743 INFO L87 Difference]: Start difference. First operand 555 states and 903 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:17:42,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:42,751 INFO L93 Difference]: Finished difference Result 1218 states and 2025 transitions. [2024-10-12 19:17:42,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:17:42,752 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 60 [2024-10-12 19:17:42,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:42,756 INFO L225 Difference]: With dead ends: 1218 [2024-10-12 19:17:42,756 INFO L226 Difference]: Without dead ends: 731 [2024-10-12 19:17:42,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:17:42,759 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 711 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 4778 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 4906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 4778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:42,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1901 Invalid, 4906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 4778 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-12 19:17:42,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-12 19:17:42,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 558. [2024-10-12 19:17:42,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 431 states have (on average 1.642691415313225) internal successors, (708), 454 states have internal predecessors, (708), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-12 19:17:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 905 transitions. [2024-10-12 19:17:42,853 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 905 transitions. Word has length 60 [2024-10-12 19:17:42,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:42,855 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 905 transitions. [2024-10-12 19:17:42,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:17:42,856 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 905 transitions. [2024-10-12 19:17:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 19:17:42,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:42,857 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] [2024-10-12 19:17:42,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:17:42,857 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:42,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:42,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1658518110, now seen corresponding path program 1 times [2024-10-12 19:17:42,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:42,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732549025] [2024-10-12 19:17:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:42,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:17:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,375 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-12 19:17:43,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:43,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732549025] [2024-10-12 19:17:43,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732549025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:43,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:43,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:43,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271916831] [2024-10-12 19:17:43,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:43,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:43,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:43,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:43,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:43,378 INFO L87 Difference]: Start difference. First operand 558 states and 905 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:46,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:46,938 INFO L93 Difference]: Finished difference Result 1239 states and 2055 transitions. [2024-10-12 19:17:46,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:17:46,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-10-12 19:17:46,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:46,943 INFO L225 Difference]: With dead ends: 1239 [2024-10-12 19:17:46,943 INFO L226 Difference]: Without dead ends: 737 [2024-10-12 19:17:46,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:17:46,946 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 719 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:46,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1047 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 19:17:46,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-12 19:17:47,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 558. [2024-10-12 19:17:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 431 states have (on average 1.631090487238979) internal successors, (703), 454 states have internal predecessors, (703), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-12 19:17:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 900 transitions. [2024-10-12 19:17:47,061 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 900 transitions. Word has length 60 [2024-10-12 19:17:47,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:47,061 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 900 transitions. [2024-10-12 19:17:47,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 900 transitions. [2024-10-12 19:17:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 19:17:47,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:47,063 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] [2024-10-12 19:17:47,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:17:47,064 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:47,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:47,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1633186840, now seen corresponding path program 1 times [2024-10-12 19:17:47,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:47,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163446056] [2024-10-12 19:17:47,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:47,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:17:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,590 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-12 19:17:47,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163446056] [2024-10-12 19:17:47,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163446056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:47,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:47,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:47,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830944784] [2024-10-12 19:17:47,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:47,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:47,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:47,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:47,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:47,596 INFO L87 Difference]: Start difference. First operand 558 states and 900 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:50,971 INFO L93 Difference]: Finished difference Result 1222 states and 2022 transitions. [2024-10-12 19:17:50,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:17:50,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2024-10-12 19:17:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:50,976 INFO L225 Difference]: With dead ends: 1222 [2024-10-12 19:17:50,977 INFO L226 Difference]: Without dead ends: 735 [2024-10-12 19:17:50,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:50,979 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1146 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 2453 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:50,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 1023 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2453 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 19:17:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-10-12 19:17:51,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 562. [2024-10-12 19:17:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 435 states have (on average 1.6229885057471265) internal successors, (706), 458 states have internal predecessors, (706), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-12 19:17:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 903 transitions. [2024-10-12 19:17:51,067 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 903 transitions. Word has length 61 [2024-10-12 19:17:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:51,068 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 903 transitions. [2024-10-12 19:17:51,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 903 transitions. [2024-10-12 19:17:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 19:17:51,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:51,069 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] [2024-10-12 19:17:51,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:17:51,070 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:51,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:51,070 INFO L85 PathProgramCache]: Analyzing trace with hash -143026632, now seen corresponding path program 1 times [2024-10-12 19:17:51,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:51,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012549052] [2024-10-12 19:17:51,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:51,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:51,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:51,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:51,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:51,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:17:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:51,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:51,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:51,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:51,555 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-12 19:17:51,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:51,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012549052] [2024-10-12 19:17:51,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012549052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:51,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:51,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:51,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84963150] [2024-10-12 19:17:51,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:51,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:51,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:51,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:51,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:51,557 INFO L87 Difference]: Start difference. First operand 562 states and 903 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:54,985 INFO L93 Difference]: Finished difference Result 1277 states and 2085 transitions. [2024-10-12 19:17:54,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:54,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2024-10-12 19:17:54,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:54,989 INFO L225 Difference]: With dead ends: 1277 [2024-10-12 19:17:54,989 INFO L226 Difference]: Without dead ends: 709 [2024-10-12 19:17:54,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:54,991 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 1103 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:54,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 1039 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 19:17:54,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-10-12 19:17:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 544. [2024-10-12 19:17:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 420 states have (on average 1.630952380952381) internal successors, (685), 441 states have internal predecessors, (685), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:17:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 878 transitions. [2024-10-12 19:17:55,066 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 878 transitions. Word has length 61 [2024-10-12 19:17:55,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:55,067 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 878 transitions. [2024-10-12 19:17:55,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 878 transitions. [2024-10-12 19:17:55,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 19:17:55,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:55,068 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] [2024-10-12 19:17:55,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:17:55,069 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:55,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:55,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1050158881, now seen corresponding path program 1 times [2024-10-12 19:17:55,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:55,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676566425] [2024-10-12 19:17:55,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:55,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:55,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:55,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:55,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:55,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:17:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:55,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:55,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:55,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:55,626 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-12 19:17:55,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:55,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676566425] [2024-10-12 19:17:55,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676566425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:55,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:55,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:55,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028107327] [2024-10-12 19:17:55,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:55,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:55,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:55,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:55,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:55,628 INFO L87 Difference]: Start difference. First operand 544 states and 878 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:59,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:59,347 INFO L93 Difference]: Finished difference Result 1204 states and 1990 transitions. [2024-10-12 19:17:59,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:17:59,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2024-10-12 19:17:59,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:59,351 INFO L225 Difference]: With dead ends: 1204 [2024-10-12 19:17:59,351 INFO L226 Difference]: Without dead ends: 719 [2024-10-12 19:17:59,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:59,353 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 685 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 2561 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:59,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1040 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2561 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 19:17:59,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-10-12 19:17:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 549. [2024-10-12 19:17:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 425 states have (on average 1.6235294117647059) internal successors, (690), 446 states have internal predecessors, (690), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:17:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 883 transitions. [2024-10-12 19:17:59,450 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 883 transitions. Word has length 62 [2024-10-12 19:17:59,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:59,450 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 883 transitions. [2024-10-12 19:17:59,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 883 transitions. [2024-10-12 19:17:59,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 19:17:59,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:59,452 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] [2024-10-12 19:17:59,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:17:59,452 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:59,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:59,453 INFO L85 PathProgramCache]: Analyzing trace with hash 191135427, now seen corresponding path program 1 times [2024-10-12 19:17:59,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:59,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005646966] [2024-10-12 19:17:59,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:59,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:59,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:59,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:59,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat