./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product31.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product31.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 752f24c6361e3daac9b48908e677c53c177497426b343006dfb6bc7474fe1fb2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:48:06,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:48:06,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:48:06,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:48:06,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:48:06,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:48:06,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:48:06,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:48:06,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:48:06,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:48:06,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:48:06,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:48:06,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:48:06,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:48:06,546 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:48:06,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:48:06,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:48:06,547 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:48:06,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:48:06,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:48:06,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:48:06,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:48:06,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:48:06,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:48:06,552 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:48:06,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:48:06,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:48:06,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:48:06,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:48:06,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:48:06,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:48:06,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:48:06,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:48:06,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:48:06,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:48:06,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:48:06,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:48:06,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:48:06,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:48:06,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:48:06,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:48:06,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:48:06,556 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 -> 752f24c6361e3daac9b48908e677c53c177497426b343006dfb6bc7474fe1fb2 [2024-10-14 02:48:06,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:48:06,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:48:06,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:48:06,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:48:06,838 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:48:06,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product31.cil.c [2024-10-14 02:48:08,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:48:08,718 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:48:08,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product31.cil.c [2024-10-14 02:48:08,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5bac6481/8c1dbe18fc814d478cf50e12a9a246ec/FLAGa8c79e1d9 [2024-10-14 02:48:08,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5bac6481/8c1dbe18fc814d478cf50e12a9a246ec [2024-10-14 02:48:08,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:48:08,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:48:08,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:48:08,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:48:08,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:48:08,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:48:08" (1/1) ... [2024-10-14 02:48:08,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641a072a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:08, skipping insertion in model container [2024-10-14 02:48:08,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:48:08" (1/1) ... [2024-10-14 02:48:08,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:48:09,012 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product31.cil.c[1545,1558] [2024-10-14 02:48:09,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:48:09,363 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:48:09,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2024-10-14 02:48:09,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [57] [2024-10-14 02:48:09,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [95] [2024-10-14 02:48:09,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [287] [2024-10-14 02:48:09,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [653] [2024-10-14 02:48:09,377 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [752] [2024-10-14 02:48:09,377 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [770] [2024-10-14 02:48:09,377 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1437] [2024-10-14 02:48:09,378 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1557] [2024-10-14 02:48:09,378 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3170] [2024-10-14 02:48:09,385 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product31.cil.c[1545,1558] [2024-10-14 02:48:09,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:48:09,526 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:48:09,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:09 WrapperNode [2024-10-14 02:48:09,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:48:09,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:48:09,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:48:09,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:48:09,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:09" (1/1) ... [2024-10-14 02:48:09,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:09" (1/1) ... [2024-10-14 02:48:09,611 INFO L138 Inliner]: procedures = 95, calls = 355, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 988 [2024-10-14 02:48:09,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:48:09,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:48:09,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:48:09,617 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:48:09,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:09" (1/1) ... [2024-10-14 02:48:09,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:09" (1/1) ... [2024-10-14 02:48:09,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:09" (1/1) ... [2024-10-14 02:48:09,689 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-14 02:48:09,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:09" (1/1) ... [2024-10-14 02:48:09,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:09" (1/1) ... [2024-10-14 02:48:09,716 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:09" (1/1) ... [2024-10-14 02:48:09,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:09" (1/1) ... [2024-10-14 02:48:09,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:09" (1/1) ... [2024-10-14 02:48:09,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:09" (1/1) ... [2024-10-14 02:48:09,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:48:09,795 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:48:09,795 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:48:09,795 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:48:09,796 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:09" (1/1) ... [2024-10-14 02:48:09,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:48:09,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:48:09,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 02:48:09,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 02:48:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:48:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-14 02:48:09,919 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-14 02:48:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-10-14 02:48:09,919 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-10-14 02:48:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-14 02:48:09,920 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-14 02:48:09,920 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-14 02:48:09,920 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-14 02:48:09,920 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-14 02:48:09,938 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-14 02:48:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-14 02:48:09,939 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-14 02:48:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-14 02:48:09,939 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-14 02:48:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-14 02:48:09,939 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-14 02:48:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-10-14 02:48:09,939 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-10-14 02:48:09,940 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 02:48:09,940 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 02:48:09,940 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 02:48:09,940 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 02:48:09,940 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-14 02:48:09,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-14 02:48:09,940 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-14 02:48:09,940 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-14 02:48:09,940 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-14 02:48:09,940 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-14 02:48:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-14 02:48:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-14 02:48:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-14 02:48:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-14 02:48:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-10-14 02:48:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-10-14 02:48:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-14 02:48:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-14 02:48:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-10-14 02:48:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-10-14 02:48:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-14 02:48:09,942 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-14 02:48:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-14 02:48:09,942 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-14 02:48:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-14 02:48:09,949 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-14 02:48:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-14 02:48:09,949 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-14 02:48:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:48:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 02:48:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 02:48:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 02:48:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 02:48:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 02:48:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 02:48:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 02:48:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 02:48:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 02:48:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 02:48:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 02:48:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 02:48:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 02:48:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 02:48:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-14 02:48:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-14 02:48:09,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-14 02:48:09,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-14 02:48:09,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-14 02:48:09,955 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-14 02:48:09,955 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-14 02:48:09,956 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-14 02:48:09,956 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-14 02:48:09,956 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-14 02:48:09,956 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-14 02:48:09,956 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-14 02:48:09,956 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-14 02:48:09,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:48:09,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:48:09,957 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-14 02:48:09,957 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-14 02:48:10,162 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:48:10,164 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:48:11,429 INFO L? ?]: Removed 493 outVars from TransFormulas that were not future-live. [2024-10-14 02:48:11,429 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:48:11,506 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:48:11,506 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:48:11,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:48:11 BoogieIcfgContainer [2024-10-14 02:48:11,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:48:11,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:48:11,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:48:11,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:48:11,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:48:08" (1/3) ... [2024-10-14 02:48:11,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e26544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:48:11, skipping insertion in model container [2024-10-14 02:48:11,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:48:09" (2/3) ... [2024-10-14 02:48:11,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e26544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:48:11, skipping insertion in model container [2024-10-14 02:48:11,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:48:11" (3/3) ... [2024-10-14 02:48:11,518 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product31.cil.c [2024-10-14 02:48:11,539 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:48:11,540 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:48:11,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:48:11,637 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;@5a0918f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:48:11,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:48:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 599 states, 456 states have (on average 1.6951754385964912) internal successors, (773), 474 states have internal predecessors, (773), 113 states have call successors, (113), 28 states have call predecessors, (113), 28 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) [2024-10-14 02:48:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 02:48:11,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:11,676 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:48:11,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:11,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:11,680 INFO L85 PathProgramCache]: Analyzing trace with hash 221988997, now seen corresponding path program 1 times [2024-10-14 02:48:11,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:11,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728520704] [2024-10-14 02:48:11,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:11,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:12,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:12,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:12,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:12,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:13,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:13,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:48:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:13,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:48:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:13,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 02:48:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:13,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:13,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 02:48:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:13,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 02:48:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:13,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:13,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:13,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:48:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:13,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 02:48:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:13,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 02:48:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 02:48:13,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:13,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728520704] [2024-10-14 02:48:13,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728520704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:13,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:13,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:48:13,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002960705] [2024-10-14 02:48:13,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:13,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:48:13,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:13,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:48:13,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:48:13,168 INFO L87 Difference]: Start difference. First operand has 599 states, 456 states have (on average 1.6951754385964912) internal successors, (773), 474 states have internal predecessors, (773), 113 states have call successors, (113), 28 states have call predecessors, (113), 28 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 02:48:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:21,943 INFO L93 Difference]: Finished difference Result 1545 states and 2689 transitions. [2024-10-14 02:48:21,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 02:48:21,946 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 101 [2024-10-14 02:48:21,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:21,972 INFO L225 Difference]: With dead ends: 1545 [2024-10-14 02:48:21,972 INFO L226 Difference]: Without dead ends: 943 [2024-10-14 02:48:21,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-14 02:48:21,992 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 2349 mSDsluCounter, 2471 mSDsCounter, 0 mSdLazyCounter, 5905 mSolverCounterSat, 714 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2468 SdHoareTripleChecker+Valid, 2934 SdHoareTripleChecker+Invalid, 6619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 714 IncrementalHoareTripleChecker+Valid, 5905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:21,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2468 Valid, 2934 Invalid, 6619 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [714 Valid, 5905 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-10-14 02:48:22,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-10-14 02:48:22,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 605. [2024-10-14 02:48:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 462 states have (on average 1.6818181818181819) internal successors, (777), 480 states have internal predecessors, (777), 114 states have call successors, (114), 28 states have call predecessors, (114), 28 states have return successors, (113), 109 states have call predecessors, (113), 111 states have call successors, (113) [2024-10-14 02:48:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1004 transitions. [2024-10-14 02:48:22,282 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1004 transitions. Word has length 101 [2024-10-14 02:48:22,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:22,282 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 1004 transitions. [2024-10-14 02:48:22,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 02:48:22,283 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1004 transitions. [2024-10-14 02:48:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 02:48:22,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:22,290 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:48:22,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:48:22,291 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:22,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:22,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1550928388, now seen corresponding path program 1 times [2024-10-14 02:48:22,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:22,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306026922] [2024-10-14 02:48:22,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:22,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:22,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:22,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:22,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:22,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:22,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:23,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:48:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:23,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:48:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:23,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 02:48:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:23,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:23,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 02:48:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:23,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 02:48:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:23,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:48:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:23,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:48:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:23,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:48:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 02:48:23,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:23,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306026922] [2024-10-14 02:48:23,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306026922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:23,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:23,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:48:23,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846128793] [2024-10-14 02:48:23,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:23,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:48:23,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:23,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:48:23,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:48:23,084 INFO L87 Difference]: Start difference. First operand 605 states and 1004 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 02:48:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:28,526 INFO L93 Difference]: Finished difference Result 1534 states and 2632 transitions. [2024-10-14 02:48:28,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 02:48:28,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2024-10-14 02:48:28,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:28,534 INFO L225 Difference]: With dead ends: 1534 [2024-10-14 02:48:28,534 INFO L226 Difference]: Without dead ends: 939 [2024-10-14 02:48:28,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:48:28,539 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 1162 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 3244 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 3518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 3244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:28,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 1520 Invalid, 3518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 3244 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-14 02:48:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2024-10-14 02:48:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 605. [2024-10-14 02:48:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 462 states have (on average 1.6796536796536796) internal successors, (776), 480 states have internal predecessors, (776), 114 states have call successors, (114), 28 states have call predecessors, (114), 28 states have return successors, (113), 109 states have call predecessors, (113), 111 states have call successors, (113) [2024-10-14 02:48:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1003 transitions. [2024-10-14 02:48:28,690 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1003 transitions. Word has length 102 [2024-10-14 02:48:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:28,691 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 1003 transitions. [2024-10-14 02:48:28,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 02:48:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1003 transitions. [2024-10-14 02:48:28,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 02:48:28,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:28,695 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:48:28,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:48:28,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:28,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:28,696 INFO L85 PathProgramCache]: Analyzing trace with hash 121256784, now seen corresponding path program 1 times [2024-10-14 02:48:28,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:28,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629301219] [2024-10-14 02:48:28,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:28,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:28,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:48:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:48:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:48:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 02:48:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 02:48:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 02:48:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:48:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:48:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:48:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 02:48:29,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:29,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629301219] [2024-10-14 02:48:29,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629301219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:29,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:29,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:48:29,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510440810] [2024-10-14 02:48:29,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:29,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:48:29,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:29,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:48:29,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:48:29,249 INFO L87 Difference]: Start difference. First operand 605 states and 1003 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 02:48:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:34,580 INFO L93 Difference]: Finished difference Result 1532 states and 2621 transitions. [2024-10-14 02:48:34,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:48:34,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2024-10-14 02:48:34,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:34,587 INFO L225 Difference]: With dead ends: 1532 [2024-10-14 02:48:34,587 INFO L226 Difference]: Without dead ends: 908 [2024-10-14 02:48:34,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:48:34,592 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1120 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 3307 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 3576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 3307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:34,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 1507 Invalid, 3576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 3307 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-14 02:48:34,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-10-14 02:48:34,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 582. [2024-10-14 02:48:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 442 states have (on average 1.669683257918552) internal successors, (738), 458 states have internal predecessors, (738), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-14 02:48:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 961 transitions. [2024-10-14 02:48:34,746 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 961 transitions. Word has length 102 [2024-10-14 02:48:34,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:34,746 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 961 transitions. [2024-10-14 02:48:34,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 02:48:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 961 transitions. [2024-10-14 02:48:34,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 02:48:34,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:34,750 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:48:34,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 02:48:34,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:34,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2008787121, now seen corresponding path program 1 times [2024-10-14 02:48:34,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:34,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042730942] [2024-10-14 02:48:34,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:34,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:48:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:48:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:48:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 02:48:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 02:48:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:48:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:48:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 02:48:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 02:48:35,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:35,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042730942] [2024-10-14 02:48:35,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042730942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:35,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:35,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:48:35,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011430282] [2024-10-14 02:48:35,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:35,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:48:35,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:35,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:48:35,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:48:35,372 INFO L87 Difference]: Start difference. First operand 582 states and 961 transitions. Second operand has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 02:48:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:42,023 INFO L93 Difference]: Finished difference Result 1496 states and 2553 transitions. [2024-10-14 02:48:42,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 02:48:42,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 103 [2024-10-14 02:48:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:42,030 INFO L225 Difference]: With dead ends: 1496 [2024-10-14 02:48:42,030 INFO L226 Difference]: Without dead ends: 902 [2024-10-14 02:48:42,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-14 02:48:42,035 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1164 mSDsluCounter, 2352 mSDsCounter, 0 mSdLazyCounter, 5836 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 2780 SdHoareTripleChecker+Invalid, 6112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 5836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:42,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 2780 Invalid, 6112 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [276 Valid, 5836 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-14 02:48:42,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-10-14 02:48:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 576. [2024-10-14 02:48:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 436 states have (on average 1.6628440366972477) internal successors, (725), 452 states have internal predecessors, (725), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-14 02:48:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 948 transitions. [2024-10-14 02:48:42,196 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 948 transitions. Word has length 103 [2024-10-14 02:48:42,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:42,196 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 948 transitions. [2024-10-14 02:48:42,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 02:48:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 948 transitions. [2024-10-14 02:48:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 02:48:42,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:42,200 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:48:42,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 02:48:42,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:42,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:42,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1474068676, now seen corresponding path program 1 times [2024-10-14 02:48:42,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:42,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290081930] [2024-10-14 02:48:42,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:42,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 02:48:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:48:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:48:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 02:48:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 02:48:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:48:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:48:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 02:48:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 02:48:42,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:42,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290081930] [2024-10-14 02:48:42,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290081930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:42,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:42,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:48:42,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853186890] [2024-10-14 02:48:42,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:42,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:48:42,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:42,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:48:42,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:48:42,910 INFO L87 Difference]: Start difference. First operand 576 states and 948 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 02:48:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:49,297 INFO L93 Difference]: Finished difference Result 1468 states and 2504 transitions. [2024-10-14 02:48:49,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:48:49,297 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 104 [2024-10-14 02:48:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:49,303 INFO L225 Difference]: With dead ends: 1468 [2024-10-14 02:48:49,303 INFO L226 Difference]: Without dead ends: 902 [2024-10-14 02:48:49,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-14 02:48:49,307 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 1629 mSDsluCounter, 2385 mSDsCounter, 0 mSdLazyCounter, 5714 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 6192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 5714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:49,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 2826 Invalid, 6192 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [478 Valid, 5714 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-14 02:48:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-10-14 02:48:49,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 576. [2024-10-14 02:48:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 436 states have (on average 1.6605504587155964) internal successors, (724), 452 states have internal predecessors, (724), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-14 02:48:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 947 transitions. [2024-10-14 02:48:49,439 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 947 transitions. Word has length 104 [2024-10-14 02:48:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:49,440 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 947 transitions. [2024-10-14 02:48:49,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 02:48:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 947 transitions. [2024-10-14 02:48:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 02:48:49,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:49,443 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:48:49,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:48:49,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:49,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:49,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1895014958, now seen corresponding path program 1 times [2024-10-14 02:48:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:49,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771717031] [2024-10-14 02:48:49,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:49,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:49,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:50,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:50,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:50,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:50,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:48:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:50,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 02:48:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:50,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:48:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:50,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:50,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 02:48:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:50,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:48:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:50,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:50,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:50,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:48:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:50,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 02:48:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:50,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 02:48:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 02:48:50,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:50,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771717031] [2024-10-14 02:48:50,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771717031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:50,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:50,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:48:50,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723131578] [2024-10-14 02:48:50,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:50,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:48:50,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:50,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:48:50,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:48:50,257 INFO L87 Difference]: Start difference. First operand 576 states and 947 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 02:48:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:56,476 INFO L93 Difference]: Finished difference Result 1484 states and 2522 transitions. [2024-10-14 02:48:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 02:48:56,477 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 105 [2024-10-14 02:48:56,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:56,482 INFO L225 Difference]: With dead ends: 1484 [2024-10-14 02:48:56,482 INFO L226 Difference]: Without dead ends: 896 [2024-10-14 02:48:56,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-14 02:48:56,486 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 1687 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 5641 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 2736 SdHoareTripleChecker+Invalid, 6137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 5641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:56,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1804 Valid, 2736 Invalid, 6137 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [496 Valid, 5641 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-14 02:48:56,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-10-14 02:48:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 570. [2024-10-14 02:48:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 430 states have (on average 1.6534883720930234) internal successors, (711), 446 states have internal predecessors, (711), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-14 02:48:56,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 934 transitions. [2024-10-14 02:48:56,625 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 934 transitions. Word has length 105 [2024-10-14 02:48:56,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:56,625 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 934 transitions. [2024-10-14 02:48:56,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 02:48:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 934 transitions. [2024-10-14 02:48:56,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 02:48:56,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:56,628 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:48:56,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:48:56,629 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:56,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:56,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1504272549, now seen corresponding path program 1 times [2024-10-14 02:48:56,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:56,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867796896] [2024-10-14 02:48:56,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:56,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:56,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:57,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:57,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:57,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:57,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:57,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:48:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:57,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 02:48:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:57,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:48:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:57,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:57,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 02:48:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:57,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 02:48:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:57,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:57,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:57,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:48:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:57,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 02:48:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:57,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 02:48:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 02:48:57,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:57,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867796896] [2024-10-14 02:48:57,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867796896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:57,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:57,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:48:57,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490659547] [2024-10-14 02:48:57,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:57,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:48:57,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:57,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:48:57,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:48:57,204 INFO L87 Difference]: Start difference. First operand 570 states and 934 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 02:49:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:02,040 INFO L93 Difference]: Finished difference Result 1456 states and 2475 transitions. [2024-10-14 02:49:02,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 02:49:02,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 106 [2024-10-14 02:49:02,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:02,047 INFO L225 Difference]: With dead ends: 1456 [2024-10-14 02:49:02,047 INFO L226 Difference]: Without dead ends: 896 [2024-10-14 02:49:02,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:49:02,051 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 1585 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 3054 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 3530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 3054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:02,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 1567 Invalid, 3530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 3054 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-14 02:49:02,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-10-14 02:49:02,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 570. [2024-10-14 02:49:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 430 states have (on average 1.6511627906976745) internal successors, (710), 446 states have internal predecessors, (710), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-14 02:49:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 933 transitions. [2024-10-14 02:49:02,185 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 933 transitions. Word has length 106 [2024-10-14 02:49:02,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:02,185 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 933 transitions. [2024-10-14 02:49:02,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 02:49:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 933 transitions. [2024-10-14 02:49:02,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 02:49:02,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:02,188 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:02,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:49:02,189 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:02,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:02,189 INFO L85 PathProgramCache]: Analyzing trace with hash -863032910, now seen corresponding path program 1 times [2024-10-14 02:49:02,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:02,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967599667] [2024-10-14 02:49:02,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:02,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:49:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:49:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:49:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 02:49:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 02:49:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 02:49:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 02:49:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 02:49:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 02:49:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 02:49:02,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:02,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967599667] [2024-10-14 02:49:02,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967599667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:02,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:02,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:49:02,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820005158] [2024-10-14 02:49:02,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:02,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:49:02,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:02,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:49:02,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:49:02,822 INFO L87 Difference]: Start difference. First operand 570 states and 933 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 02:49:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:09,049 INFO L93 Difference]: Finished difference Result 1472 states and 2491 transitions. [2024-10-14 02:49:09,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 02:49:09,050 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 107 [2024-10-14 02:49:09,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:09,055 INFO L225 Difference]: With dead ends: 1472 [2024-10-14 02:49:09,056 INFO L226 Difference]: Without dead ends: 890 [2024-10-14 02:49:09,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-14 02:49:09,059 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 1638 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 5532 mSolverCounterSat, 497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 6029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 497 IncrementalHoareTripleChecker+Valid, 5532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:09,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1755 Valid, 2819 Invalid, 6029 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [497 Valid, 5532 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-14 02:49:09,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-10-14 02:49:09,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 564. [2024-10-14 02:49:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 424 states have (on average 1.6438679245283019) internal successors, (697), 440 states have internal predecessors, (697), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-14 02:49:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 920 transitions. [2024-10-14 02:49:09,201 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 920 transitions. Word has length 107 [2024-10-14 02:49:09,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:09,202 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 920 transitions. [2024-10-14 02:49:09,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 02:49:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 920 transitions. [2024-10-14 02:49:09,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 02:49:09,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:09,205 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:09,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:49:09,205 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:09,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:09,206 INFO L85 PathProgramCache]: Analyzing trace with hash 299867089, now seen corresponding path program 1 times [2024-10-14 02:49:09,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:09,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946880031] [2024-10-14 02:49:09,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:09,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:49:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:49:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:49:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 02:49:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 02:49:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 02:49:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 02:49:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 02:49:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 02:49:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 02:49:09,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:09,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946880031] [2024-10-14 02:49:09,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946880031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:09,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:09,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:49:09,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695215378] [2024-10-14 02:49:09,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:09,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:49:09,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:09,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:49:09,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:49:09,757 INFO L87 Difference]: Start difference. First operand 564 states and 920 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 02:49:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:14,249 INFO L93 Difference]: Finished difference Result 1444 states and 2446 transitions. [2024-10-14 02:49:14,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 02:49:14,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 107 [2024-10-14 02:49:14,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:14,255 INFO L225 Difference]: With dead ends: 1444 [2024-10-14 02:49:14,255 INFO L226 Difference]: Without dead ends: 890 [2024-10-14 02:49:14,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:49:14,259 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 2099 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 2840 mSolverCounterSat, 706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2217 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 3546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 706 IncrementalHoareTripleChecker+Valid, 2840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:14,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2217 Valid, 1514 Invalid, 3546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [706 Valid, 2840 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 02:49:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-10-14 02:49:14,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 564. [2024-10-14 02:49:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 424 states have (on average 1.6415094339622642) internal successors, (696), 440 states have internal predecessors, (696), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-14 02:49:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 919 transitions. [2024-10-14 02:49:14,428 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 919 transitions. Word has length 107 [2024-10-14 02:49:14,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:14,428 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 919 transitions. [2024-10-14 02:49:14,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 02:49:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 919 transitions. [2024-10-14 02:49:14,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 02:49:14,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:14,431 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:14,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 02:49:14,431 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:14,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1055702859, now seen corresponding path program 1 times [2024-10-14 02:49:14,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:14,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434585850] [2024-10-14 02:49:14,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:14,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:49:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:49:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:49:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:49:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 02:49:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 02:49:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:49:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 02:49:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 02:49:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 02:49:14,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:14,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434585850] [2024-10-14 02:49:14,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434585850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:14,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:14,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:49:14,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144938817] [2024-10-14 02:49:14,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:14,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:49:14,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:14,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:49:14,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:49:14,974 INFO L87 Difference]: Start difference. First operand 564 states and 919 transitions. Second operand has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 02:49:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:20,889 INFO L93 Difference]: Finished difference Result 1450 states and 2450 transitions. [2024-10-14 02:49:20,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:49:20,890 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 108 [2024-10-14 02:49:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:20,896 INFO L225 Difference]: With dead ends: 1450 [2024-10-14 02:49:20,896 INFO L226 Difference]: Without dead ends: 896 [2024-10-14 02:49:20,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-10-14 02:49:20,899 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 1576 mSDsluCounter, 2286 mSDsCounter, 0 mSdLazyCounter, 5364 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 5860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 5364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:20,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 2707 Invalid, 5860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 5364 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-14 02:49:20,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-10-14 02:49:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 570. [2024-10-14 02:49:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 430 states have (on average 1.6325581395348838) internal successors, (702), 446 states have internal predecessors, (702), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-14 02:49:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 925 transitions. [2024-10-14 02:49:21,077 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 925 transitions. Word has length 108 [2024-10-14 02:49:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:21,077 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 925 transitions. [2024-10-14 02:49:21,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 02:49:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 925 transitions. [2024-10-14 02:49:21,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 02:49:21,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:21,080 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:21,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 02:49:21,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:21,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:21,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1295942605, now seen corresponding path program 1 times [2024-10-14 02:49:21,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:21,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296763342] [2024-10-14 02:49:21,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:21,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:49:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:49:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:49:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:49:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 02:49:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 02:49:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:49:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 02:49:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 02:49:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 02:49:21,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:21,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296763342] [2024-10-14 02:49:21,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296763342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:21,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:21,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:49:21,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295441826] [2024-10-14 02:49:21,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:21,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:49:21,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:21,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:49:21,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:49:21,673 INFO L87 Difference]: Start difference. First operand 570 states and 925 transitions. Second operand has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 02:49:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:28,194 INFO L93 Difference]: Finished difference Result 1458 states and 2456 transitions. [2024-10-14 02:49:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:49:28,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 108 [2024-10-14 02:49:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:28,201 INFO L225 Difference]: With dead ends: 1458 [2024-10-14 02:49:28,201 INFO L226 Difference]: Without dead ends: 890 [2024-10-14 02:49:28,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-14 02:49:28,205 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 1050 mSDsluCounter, 2412 mSDsCounter, 0 mSdLazyCounter, 5564 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 2852 SdHoareTripleChecker+Invalid, 5832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 5564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:28,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 2852 Invalid, 5832 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [268 Valid, 5564 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-14 02:49:28,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-10-14 02:49:28,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 564. [2024-10-14 02:49:28,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 424 states have (on average 1.6391509433962264) internal successors, (695), 440 states have internal predecessors, (695), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-14 02:49:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 918 transitions. [2024-10-14 02:49:28,398 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 918 transitions. Word has length 108 [2024-10-14 02:49:28,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:28,399 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 918 transitions. [2024-10-14 02:49:28,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 02:49:28,399 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 918 transitions. [2024-10-14 02:49:28,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 02:49:28,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:28,402 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:28,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 02:49:28,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:28,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:28,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1831726551, now seen corresponding path program 1 times [2024-10-14 02:49:28,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:28,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906187519] [2024-10-14 02:49:28,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:28,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:49:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:49:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 02:49:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:49:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:49:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 02:49:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 02:49:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 02:49:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 02:49:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:49:28,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:28,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906187519] [2024-10-14 02:49:28,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906187519] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:49:28,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508280940] [2024-10-14 02:49:28,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:28,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:49:28,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:49:28,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:49:28,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 02:49:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:29,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 02:49:29,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:49:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:49:29,370 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:49:29,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508280940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:29,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:49:29,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-14 02:49:29,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689356797] [2024-10-14 02:49:29,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:29,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 02:49:29,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:29,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 02:49:29,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:49:29,372 INFO L87 Difference]: Start difference. First operand 564 states and 918 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)