./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_spec9_product26.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_spec9_product26.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 d5d3c0f581b3d52ccfb3e43d6fb6458a66cd40c307750c0d7336040b60b78e76 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:49:03,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:49:03,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:49:03,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:49:03,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:49:03,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:49:03,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:49:03,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:49:03,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:49:03,686 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:49:03,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:49:03,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:49:03,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:49:03,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:49:03,688 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:49:03,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:49:03,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:49:03,689 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:49:03,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:49:03,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:49:03,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:49:03,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:49:03,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:49:03,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:49:03,698 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:49:03,698 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:49:03,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:49:03,698 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:49:03,699 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:49:03,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:49:03,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:49:03,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:49:03,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:49:03,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:49:03,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:49:03,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:49:03,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:49:03,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:49:03,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:49:03,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:49:03,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:49:03,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:49:03,703 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 -> d5d3c0f581b3d52ccfb3e43d6fb6458a66cd40c307750c0d7336040b60b78e76 [2024-10-14 02:49:03,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:49:03,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:49:03,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:49:03,974 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:49:03,975 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:49:03,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c [2024-10-14 02:49:05,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:49:05,701 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:49:05,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c [2024-10-14 02:49:05,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5402af355/910987ef4f354011ac9e11c7b9833983/FLAG44213c99f [2024-10-14 02:49:05,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5402af355/910987ef4f354011ac9e11c7b9833983 [2024-10-14 02:49:05,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:49:05,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:49:05,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:49:05,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:49:05,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:49:05,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:49:05" (1/1) ... [2024-10-14 02:49:05,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c630fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:05, skipping insertion in model container [2024-10-14 02:49:05,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:49:05" (1/1) ... [2024-10-14 02:49:06,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:49:06,475 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_spec9_product26.cil.c[46529,46542] [2024-10-14 02:49:06,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:49:06,559 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:49:06,568 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2024-10-14 02:49:06,569 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [414] [2024-10-14 02:49:06,570 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [428] [2024-10-14 02:49:06,570 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [594] [2024-10-14 02:49:06,571 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2119] [2024-10-14 02:49:06,571 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2128] [2024-10-14 02:49:06,571 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2790] [2024-10-14 02:49:06,571 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3145] [2024-10-14 02:49:06,572 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3236] [2024-10-14 02:49:06,572 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3271] [2024-10-14 02:49:06,646 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_spec9_product26.cil.c[46529,46542] [2024-10-14 02:49:06,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:49:06,708 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:49:06,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:06 WrapperNode [2024-10-14 02:49:06,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:49:06,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:49:06,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:49:06,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:49:06,716 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:49:06" (1/1) ... [2024-10-14 02:49:06,749 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:49:06" (1/1) ... [2024-10-14 02:49:06,800 INFO L138 Inliner]: procedures = 93, calls = 337, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 813 [2024-10-14 02:49:06,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:49:06,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:49:06,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:49:06,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:49:06,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:06" (1/1) ... [2024-10-14 02:49:06,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:06" (1/1) ... [2024-10-14 02:49:06,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:06" (1/1) ... [2024-10-14 02:49:06,872 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:49:06,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:06" (1/1) ... [2024-10-14 02:49:06,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:06" (1/1) ... [2024-10-14 02:49:06,894 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:06" (1/1) ... [2024-10-14 02:49:06,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:06" (1/1) ... [2024-10-14 02:49:06,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:06" (1/1) ... [2024-10-14 02:49:06,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:06" (1/1) ... [2024-10-14 02:49:06,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:49:06,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:49:06,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:49:06,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:49:06,928 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:06" (1/1) ... [2024-10-14 02:49:06,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:49:06,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:49:06,966 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:49:06,970 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:49:07,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:49:07,017 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-14 02:49:07,017 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-14 02:49:07,017 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-14 02:49:07,017 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-14 02:49:07,017 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-14 02:49:07,018 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-14 02:49:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-14 02:49:07,018 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-14 02:49:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-14 02:49:07,018 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-14 02:49:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 02:49:07,019 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 02:49:07,019 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 02:49:07,019 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 02:49:07,019 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-14 02:49:07,019 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-14 02:49:07,019 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-14 02:49:07,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-14 02:49:07,020 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-14 02:49:07,020 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-14 02:49:07,020 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-14 02:49:07,020 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-14 02:49:07,020 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-14 02:49:07,020 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-14 02:49:07,021 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-14 02:49:07,021 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-14 02:49:07,021 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-14 02:49:07,021 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-14 02:49:07,021 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2024-10-14 02:49:07,021 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2024-10-14 02:49:07,022 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-14 02:49:07,022 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-14 02:49:07,022 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-14 02:49:07,022 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-14 02:49:07,022 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-14 02:49:07,022 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-14 02:49:07,022 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-10-14 02:49:07,022 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-10-14 02:49:07,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:49:07,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 02:49:07,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 02:49:07,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 02:49:07,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 02:49:07,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 02:49:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 02:49:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 02:49:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 02:49:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 02:49:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 02:49:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 02:49:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 02:49:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 02:49:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 02:49:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-14 02:49:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-14 02:49:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-14 02:49:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-14 02:49:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-14 02:49:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-14 02:49:07,026 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-14 02:49:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-14 02:49:07,026 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-14 02:49:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-14 02:49:07,027 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-14 02:49:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:49:07,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:49:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-14 02:49:07,027 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-14 02:49:07,224 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:49:07,227 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:49:08,382 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2024-10-14 02:49:08,382 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:49:08,506 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:49:08,506 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:49:08,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:49:08 BoogieIcfgContainer [2024-10-14 02:49:08,507 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:49:08,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:49:08,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:49:08,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:49:08,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:49:05" (1/3) ... [2024-10-14 02:49:08,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf7bf71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:49:08, skipping insertion in model container [2024-10-14 02:49:08,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:06" (2/3) ... [2024-10-14 02:49:08,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf7bf71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:49:08, skipping insertion in model container [2024-10-14 02:49:08,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:49:08" (3/3) ... [2024-10-14 02:49:08,521 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product26.cil.c [2024-10-14 02:49:08,543 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:49:08,543 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:49:08,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:49:08,636 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;@2187eea8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:49:08,636 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:49:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 524 states, 410 states have (on average 1.7439024390243902) internal successors, (715), 433 states have internal predecessors, (715), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (89), 82 states have call predecessors, (89), 89 states have call successors, (89) [2024-10-14 02:49:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 02:49:08,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:08,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:08,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:08,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:08,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1452284348, now seen corresponding path program 1 times [2024-10-14 02:49:08,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:08,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477830838] [2024-10-14 02:49:08,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:08,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:49:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:49:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:09,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:09,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477830838] [2024-10-14 02:49:09,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477830838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:09,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:09,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:49:09,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738884271] [2024-10-14 02:49:09,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:09,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:49:09,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:09,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:49:09,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:49:09,974 INFO L87 Difference]: Start difference. First operand has 524 states, 410 states have (on average 1.7439024390243902) internal successors, (715), 433 states have internal predecessors, (715), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (89), 82 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:49:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:14,891 INFO L93 Difference]: Finished difference Result 1182 states and 2039 transitions. [2024-10-14 02:49:14,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:49:14,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2024-10-14 02:49:14,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:14,917 INFO L225 Difference]: With dead ends: 1182 [2024-10-14 02:49:14,917 INFO L226 Difference]: Without dead ends: 667 [2024-10-14 02:49:14,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:49:14,937 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 1105 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 2783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:14,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 999 Invalid, 2783 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [244 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-14 02:49:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-10-14 02:49:15,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 520. [2024-10-14 02:49:15,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 408 states have (on average 1.732843137254902) internal successors, (707), 429 states have internal predecessors, (707), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-14 02:49:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 880 transitions. [2024-10-14 02:49:15,147 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 880 transitions. Word has length 48 [2024-10-14 02:49:15,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:15,148 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 880 transitions. [2024-10-14 02:49:15,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:49:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 880 transitions. [2024-10-14 02:49:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 02:49:15,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:15,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:15,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:49:15,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:15,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:15,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1634984533, now seen corresponding path program 1 times [2024-10-14 02:49:15,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:15,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467139874] [2024-10-14 02:49:15,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:15,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:15,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:15,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:15,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:15,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:49:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:15,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:15,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:15,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:15,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:15,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467139874] [2024-10-14 02:49:15,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467139874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:15,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:15,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:49:15,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852029596] [2024-10-14 02:49:15,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:15,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:49:15,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:15,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:49:15,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:49:15,778 INFO L87 Difference]: Start difference. First operand 520 states and 880 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:49:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:19,901 INFO L93 Difference]: Finished difference Result 1175 states and 2012 transitions. [2024-10-14 02:49:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:49:19,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2024-10-14 02:49:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:19,908 INFO L225 Difference]: With dead ends: 1175 [2024-10-14 02:49:19,908 INFO L226 Difference]: Without dead ends: 667 [2024-10-14 02:49:19,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:49:19,911 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 1095 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 2765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:19,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 1027 Invalid, 2765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-14 02:49:19,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-10-14 02:49:19,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 520. [2024-10-14 02:49:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 408 states have (on average 1.7303921568627452) internal successors, (706), 429 states have internal predecessors, (706), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-14 02:49:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 879 transitions. [2024-10-14 02:49:19,998 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 879 transitions. Word has length 50 [2024-10-14 02:49:19,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:19,999 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 879 transitions. [2024-10-14 02:49:19,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:49:20,000 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 879 transitions. [2024-10-14 02:49:20,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 02:49:20,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:20,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:20,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:49:20,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:20,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:20,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1901080813, now seen corresponding path program 1 times [2024-10-14 02:49:20,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:20,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232684446] [2024-10-14 02:49:20,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:20,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:20,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:20,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:20,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:49:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:20,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 02:49:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:20,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:20,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:20,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:20,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:20,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:20,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232684446] [2024-10-14 02:49:20,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232684446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:20,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:20,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:49:20,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459257005] [2024-10-14 02:49:20,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:20,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:49:20,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:20,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:49:20,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:49:20,623 INFO L87 Difference]: Start difference. First operand 520 states and 879 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:49:24,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:24,393 INFO L93 Difference]: Finished difference Result 1175 states and 2011 transitions. [2024-10-14 02:49:24,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:49:24,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 51 [2024-10-14 02:49:24,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:24,401 INFO L225 Difference]: With dead ends: 1175 [2024-10-14 02:49:24,401 INFO L226 Difference]: Without dead ends: 667 [2024-10-14 02:49:24,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:49:24,405 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 657 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 2685 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:24,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 1029 Invalid, 2796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2685 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 02:49:24,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-10-14 02:49:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 520. [2024-10-14 02:49:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 408 states have (on average 1.7279411764705883) internal successors, (705), 429 states have internal predecessors, (705), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-14 02:49:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 878 transitions. [2024-10-14 02:49:24,509 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 878 transitions. Word has length 51 [2024-10-14 02:49:24,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:24,509 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 878 transitions. [2024-10-14 02:49:24,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:49:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 878 transitions. [2024-10-14 02:49:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 02:49:24,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:24,512 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:24,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 02:49:24,513 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:24,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:24,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1944829713, now seen corresponding path program 1 times [2024-10-14 02:49:24,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:24,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547312720] [2024-10-14 02:49:24,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:24,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:24,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:24,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:24,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 02:49:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:25,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:49:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:25,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:25,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:25,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:25,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:25,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547312720] [2024-10-14 02:49:25,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547312720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:25,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:25,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:49:25,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186688167] [2024-10-14 02:49:25,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:25,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:49:25,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:25,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:49:25,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:49:25,080 INFO L87 Difference]: Start difference. First operand 520 states and 878 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:49:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:29,085 INFO L93 Difference]: Finished difference Result 1175 states and 2010 transitions. [2024-10-14 02:49:29,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:49:29,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2024-10-14 02:49:29,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:29,090 INFO L225 Difference]: With dead ends: 1175 [2024-10-14 02:49:29,090 INFO L226 Difference]: Without dead ends: 667 [2024-10-14 02:49:29,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:49:29,094 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 654 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 2673 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 2791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:29,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 987 Invalid, 2791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2673 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-14 02:49:29,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-10-14 02:49:29,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 520. [2024-10-14 02:49:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 408 states have (on average 1.7254901960784315) internal successors, (704), 429 states have internal predecessors, (704), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-14 02:49:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 877 transitions. [2024-10-14 02:49:29,173 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 877 transitions. Word has length 52 [2024-10-14 02:49:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:29,174 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 877 transitions. [2024-10-14 02:49:29,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:49:29,174 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 877 transitions. [2024-10-14 02:49:29,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 02:49:29,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:29,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:29,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 02:49:29,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:29,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:29,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1591209009, now seen corresponding path program 1 times [2024-10-14 02:49:29,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:29,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620057176] [2024-10-14 02:49:29,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:29,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:29,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:29,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:29,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 02:49:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:29,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 02:49:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:29,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:29,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:29,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:29,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:29,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620057176] [2024-10-14 02:49:29,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620057176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:29,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:29,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:49:29,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719666045] [2024-10-14 02:49:29,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:29,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:49:29,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:29,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:49:29,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:49:29,753 INFO L87 Difference]: Start difference. First operand 520 states and 877 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:49:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:33,487 INFO L93 Difference]: Finished difference Result 1175 states and 2009 transitions. [2024-10-14 02:49:33,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:49:33,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2024-10-14 02:49:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:33,492 INFO L225 Difference]: With dead ends: 1175 [2024-10-14 02:49:33,493 INFO L226 Difference]: Without dead ends: 667 [2024-10-14 02:49:33,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:49:33,496 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1089 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 2529 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 2529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:33,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 1006 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 2529 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 02:49:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-10-14 02:49:33,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 520. [2024-10-14 02:49:33,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 408 states have (on average 1.7230392156862746) internal successors, (703), 429 states have internal predecessors, (703), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-14 02:49:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 876 transitions. [2024-10-14 02:49:33,575 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 876 transitions. Word has length 53 [2024-10-14 02:49:33,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:33,576 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 876 transitions. [2024-10-14 02:49:33,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:49:33,576 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 876 transitions. [2024-10-14 02:49:33,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 02:49:33,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:33,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:33,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:49:33,578 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:33,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:33,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2039440435, now seen corresponding path program 1 times [2024-10-14 02:49:33,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:33,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062706386] [2024-10-14 02:49:33,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:33,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:33,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:33,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:33,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:34,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 02:49:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:34,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:34,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:34,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:34,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:34,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062706386] [2024-10-14 02:49:34,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062706386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:34,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:34,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:49:34,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957662788] [2024-10-14 02:49:34,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:34,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:49:34,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:34,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:49:34,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:49:34,262 INFO L87 Difference]: Start difference. First operand 520 states and 876 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:49:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:39,655 INFO L93 Difference]: Finished difference Result 1151 states and 1958 transitions. [2024-10-14 02:49:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:49:39,656 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2024-10-14 02:49:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:39,661 INFO L225 Difference]: With dead ends: 1151 [2024-10-14 02:49:39,661 INFO L226 Difference]: Without dead ends: 691 [2024-10-14 02:49:39,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-14 02:49:39,664 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 742 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 4895 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 5010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 4895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:39,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 1841 Invalid, 5010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 4895 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-14 02:49:39,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-14 02:49:39,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 532. [2024-10-14 02:49:39,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 417 states have (on average 1.7194244604316546) internal successors, (717), 440 states have internal predecessors, (717), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-10-14 02:49:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 894 transitions. [2024-10-14 02:49:39,764 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 894 transitions. Word has length 54 [2024-10-14 02:49:39,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:39,764 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 894 transitions. [2024-10-14 02:49:39,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:49:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 894 transitions. [2024-10-14 02:49:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 02:49:39,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:39,767 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:39,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:49:39,768 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:39,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:39,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1590743796, now seen corresponding path program 1 times [2024-10-14 02:49:39,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:39,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150160586] [2024-10-14 02:49:39,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:39,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:39,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:39,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:39,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 02:49:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:40,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:40,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150160586] [2024-10-14 02:49:40,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150160586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:40,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:40,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:49:40,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641781820] [2024-10-14 02:49:40,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:40,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:49:40,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:40,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:49:40,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:49:40,314 INFO L87 Difference]: Start difference. First operand 532 states and 894 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:49:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:43,788 INFO L93 Difference]: Finished difference Result 1173 states and 1996 transitions. [2024-10-14 02:49:43,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:49:43,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-10-14 02:49:43,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:43,794 INFO L225 Difference]: With dead ends: 1173 [2024-10-14 02:49:43,794 INFO L226 Difference]: Without dead ends: 697 [2024-10-14 02:49:43,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:49:43,797 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 712 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 2648 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 2765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:43,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1023 Invalid, 2765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2648 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 02:49:43,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-10-14 02:49:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 532. [2024-10-14 02:49:43,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 417 states have (on average 1.7074340527577938) internal successors, (712), 440 states have internal predecessors, (712), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-10-14 02:49:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 889 transitions. [2024-10-14 02:49:43,878 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 889 transitions. Word has length 54 [2024-10-14 02:49:43,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:43,878 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 889 transitions. [2024-10-14 02:49:43,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:49:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 889 transitions. [2024-10-14 02:49:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 02:49:43,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:43,880 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:43,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:49:43,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:43,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:43,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1824446511, now seen corresponding path program 1 times [2024-10-14 02:49:43,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:43,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388187857] [2024-10-14 02:49:43,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:43,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:49:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:44,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:44,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388187857] [2024-10-14 02:49:44,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388187857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:44,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:44,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:49:44,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551816673] [2024-10-14 02:49:44,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:44,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:49:44,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:44,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:49:44,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:49:44,449 INFO L87 Difference]: Start difference. First operand 532 states and 889 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:49:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:47,807 INFO L93 Difference]: Finished difference Result 1173 states and 1991 transitions. [2024-10-14 02:49:47,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:49:47,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 55 [2024-10-14 02:49:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:47,811 INFO L225 Difference]: With dead ends: 1173 [2024-10-14 02:49:47,811 INFO L226 Difference]: Without dead ends: 697 [2024-10-14 02:49:47,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:49:47,814 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 711 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 2619 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:47,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1023 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2619 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 02:49:47,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-10-14 02:49:47,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 532. [2024-10-14 02:49:47,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 417 states have (on average 1.6954436450839327) internal successors, (707), 440 states have internal predecessors, (707), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-10-14 02:49:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 884 transitions. [2024-10-14 02:49:47,901 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 884 transitions. Word has length 55 [2024-10-14 02:49:47,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:47,901 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 884 transitions. [2024-10-14 02:49:47,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:49:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 884 transitions. [2024-10-14 02:49:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 02:49:47,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:47,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:47,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:49:47,903 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:47,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:47,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1640862767, now seen corresponding path program 1 times [2024-10-14 02:49:47,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:47,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47792990] [2024-10-14 02:49:47,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:47,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:49:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:48,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:48,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47792990] [2024-10-14 02:49:48,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47792990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:48,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:48,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:49:48,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757346034] [2024-10-14 02:49:48,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:48,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:49:48,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:48,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:49:48,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:49:48,523 INFO L87 Difference]: Start difference. First operand 532 states and 884 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:49:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:51,800 INFO L93 Difference]: Finished difference Result 1173 states and 1986 transitions. [2024-10-14 02:49:51,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:49:51,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2024-10-14 02:49:51,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:51,806 INFO L225 Difference]: With dead ends: 1173 [2024-10-14 02:49:51,806 INFO L226 Difference]: Without dead ends: 697 [2024-10-14 02:49:51,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:49:51,809 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 709 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 2708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:51,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 990 Invalid, 2708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 02:49:51,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-10-14 02:49:51,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 532. [2024-10-14 02:49:51,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 417 states have (on average 1.683453237410072) internal successors, (702), 440 states have internal predecessors, (702), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-10-14 02:49:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 879 transitions. [2024-10-14 02:49:51,896 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 879 transitions. Word has length 56 [2024-10-14 02:49:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:51,896 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 879 transitions. [2024-10-14 02:49:51,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:49:51,897 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 879 transitions. [2024-10-14 02:49:51,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 02:49:51,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:51,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:51,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 02:49:51,898 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:51,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:51,899 INFO L85 PathProgramCache]: Analyzing trace with hash 318438634, now seen corresponding path program 1 times [2024-10-14 02:49:51,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:51,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257367919] [2024-10-14 02:49:51,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:51,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:52,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:52,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:52,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:52,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:49:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:52,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:52,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:52,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:52,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:52,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257367919] [2024-10-14 02:49:52,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257367919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:52,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:52,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:49:52,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315875201] [2024-10-14 02:49:52,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:52,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:49:52,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:52,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:49:52,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:49:52,496 INFO L87 Difference]: Start difference. First operand 532 states and 879 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:49:57,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:57,238 INFO L93 Difference]: Finished difference Result 1153 states and 1944 transitions. [2024-10-14 02:49:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:49:57,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-14 02:49:57,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:57,242 INFO L225 Difference]: With dead ends: 1153 [2024-10-14 02:49:57,243 INFO L226 Difference]: Without dead ends: 691 [2024-10-14 02:49:57,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:49:57,245 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 1143 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 4569 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 4815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 4569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:57,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 1768 Invalid, 4815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 4569 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-14 02:49:57,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-14 02:49:57,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 532. [2024-10-14 02:49:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 417 states have (on average 1.6810551558752997) internal successors, (701), 440 states have internal predecessors, (701), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-10-14 02:49:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 878 transitions. [2024-10-14 02:49:57,349 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 878 transitions. Word has length 57 [2024-10-14 02:49:57,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:57,349 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 878 transitions. [2024-10-14 02:49:57,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:49:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 878 transitions. [2024-10-14 02:49:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 02:49:57,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:57,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:57,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 02:49:57,352 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:57,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1406300682, now seen corresponding path program 1 times [2024-10-14 02:49:57,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:57,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471488205] [2024-10-14 02:49:57,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:57,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:57,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:57,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:57,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:57,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:49:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:57,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:57,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:57,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:57,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:57,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471488205] [2024-10-14 02:49:57,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471488205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:57,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:57,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:49:57,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133548167] [2024-10-14 02:49:57,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:57,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:49:57,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:57,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:49:57,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:49:57,841 INFO L87 Difference]: Start difference. First operand 532 states and 878 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:50:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:01,144 INFO L93 Difference]: Finished difference Result 1173 states and 1977 transitions. [2024-10-14 02:50:01,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:50:01,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2024-10-14 02:50:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:01,148 INFO L225 Difference]: With dead ends: 1173 [2024-10-14 02:50:01,148 INFO L226 Difference]: Without dead ends: 697 [2024-10-14 02:50:01,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:01,150 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 708 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:01,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 1012 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2564 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 02:50:01,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-10-14 02:50:01,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 532. [2024-10-14 02:50:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 417 states have (on average 1.669064748201439) internal successors, (696), 440 states have internal predecessors, (696), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-10-14 02:50:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 873 transitions. [2024-10-14 02:50:01,231 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 873 transitions. Word has length 57 [2024-10-14 02:50:01,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:01,231 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 873 transitions. [2024-10-14 02:50:01,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:50:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 873 transitions. [2024-10-14 02:50:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 02:50:01,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:01,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:50:01,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 02:50:01,233 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:01,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:01,234 INFO L85 PathProgramCache]: Analyzing trace with hash -257982260, now seen corresponding path program 1 times [2024-10-14 02:50:01,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:01,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789809173] [2024-10-14 02:50:01,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:01,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:50:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:50:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:50:01,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:01,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789809173] [2024-10-14 02:50:01,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789809173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:01,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:01,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:50:01,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072824576] [2024-10-14 02:50:01,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:01,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:50:01,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:01,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:50:01,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:50:01,757 INFO L87 Difference]: Start difference. First operand 532 states and 873 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:50:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:05,074 INFO L93 Difference]: Finished difference Result 1157 states and 1943 transitions. [2024-10-14 02:50:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:50:05,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-14 02:50:05,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:05,079 INFO L225 Difference]: With dead ends: 1157 [2024-10-14 02:50:05,079 INFO L226 Difference]: Without dead ends: 693 [2024-10-14 02:50:05,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:50:05,080 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 1131 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 2419 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 2658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 2419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:05,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 969 Invalid, 2658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 2419 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 02:50:05,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-14 02:50:05,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 535. [2024-10-14 02:50:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 420 states have (on average 1.661904761904762) internal successors, (698), 443 states have internal predecessors, (698), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-10-14 02:50:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 875 transitions. [2024-10-14 02:50:05,164 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 875 transitions. Word has length 58 [2024-10-14 02:50:05,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:05,164 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 875 transitions. [2024-10-14 02:50:05,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:50:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 875 transitions. [2024-10-14 02:50:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 02:50:05,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:05,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:50:05,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 02:50:05,166 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:05,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:05,167 INFO L85 PathProgramCache]: Analyzing trace with hash -408589974, now seen corresponding path program 1 times [2024-10-14 02:50:05,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:05,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158366771] [2024-10-14 02:50:05,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:05,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:50:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:50:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:50:05,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:05,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158366771] [2024-10-14 02:50:05,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158366771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:05,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:05,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:50:05,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360965002] [2024-10-14 02:50:05,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:05,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:50:05,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:05,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:50:05,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:50:05,737 INFO L87 Difference]: Start difference. First operand 535 states and 875 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:50:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:08,776 INFO L93 Difference]: Finished difference Result 1182 states and 1977 transitions. [2024-10-14 02:50:08,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:50:08,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-14 02:50:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:08,780 INFO L225 Difference]: With dead ends: 1182 [2024-10-14 02:50:08,780 INFO L226 Difference]: Without dead ends: 703 [2024-10-14 02:50:08,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:08,782 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 1147 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 2655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:08,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 1001 Invalid, 2655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 02:50:08,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-10-14 02:50:08,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 535. [2024-10-14 02:50:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 420 states have (on average 1.65) internal successors, (693), 443 states have internal predecessors, (693), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-10-14 02:50:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 870 transitions. [2024-10-14 02:50:08,874 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 870 transitions. Word has length 58 [2024-10-14 02:50:08,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:08,875 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 870 transitions. [2024-10-14 02:50:08,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:50:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 870 transitions. [2024-10-14 02:50:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 02:50:08,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:08,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:50:08,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 02:50:08,877 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:08,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:08,877 INFO L85 PathProgramCache]: Analyzing trace with hash -114668091, now seen corresponding path program 1 times [2024-10-14 02:50:08,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:08,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775913706] [2024-10-14 02:50:08,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:08,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:09,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:09,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:09,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:09,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:50:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:09,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:09,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:09,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:50:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:09,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:50:09,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:09,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775913706] [2024-10-14 02:50:09,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775913706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:09,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:09,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:50:09,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395830360] [2024-10-14 02:50:09,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:09,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:50:09,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:09,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:50:09,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:50:09,492 INFO L87 Difference]: Start difference. First operand 535 states and 870 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:50:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:14,276 INFO L93 Difference]: Finished difference Result 1169 states and 1948 transitions. [2024-10-14 02:50:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:50:14,277 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-14 02:50:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:14,281 INFO L225 Difference]: With dead ends: 1169 [2024-10-14 02:50:14,281 INFO L226 Difference]: Without dead ends: 705 [2024-10-14 02:50:14,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:50:14,283 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 691 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 4644 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 4764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 4644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:14,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1781 Invalid, 4764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 4644 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-14 02:50:14,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-14 02:50:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 539. [2024-10-14 02:50:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 424 states have (on average 1.6415094339622642) internal successors, (696), 447 states have internal predecessors, (696), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2024-10-14 02:50:14,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 873 transitions. [2024-10-14 02:50:14,384 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 873 transitions. Word has length 59 [2024-10-14 02:50:14,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:14,385 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 873 transitions. [2024-10-14 02:50:14,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:50:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 873 transitions. [2024-10-14 02:50:14,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 02:50:14,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:14,386 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:50:14,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 02:50:14,387 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:14,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash 325941221, now seen corresponding path program 1 times [2024-10-14 02:50:14,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:14,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185413676] [2024-10-14 02:50:14,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:14,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:14,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:14,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:14,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:14,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:50:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:14,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:14,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:14,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:50:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:50:14,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:14,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185413676] [2024-10-14 02:50:14,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185413676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:14,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:14,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:50:14,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847046839] [2024-10-14 02:50:14,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:14,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:50:14,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:14,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:50:14,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:50:14,942 INFO L87 Difference]: Start difference. First operand 539 states and 873 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:50:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:19,571 INFO L93 Difference]: Finished difference Result 1226 states and 2021 transitions. [2024-10-14 02:50:19,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 02:50:19,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-14 02:50:19,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:19,575 INFO L225 Difference]: With dead ends: 1226 [2024-10-14 02:50:19,575 INFO L226 Difference]: Without dead ends: 681 [2024-10-14 02:50:19,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:50:19,577 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 652 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 4668 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 4787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 4668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:19,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1762 Invalid, 4787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 4668 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-14 02:50:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-14 02:50:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 525. [2024-10-14 02:50:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.645631067961165) internal successors, (678), 433 states have internal predecessors, (678), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (86), 82 states have call predecessors, (86), 84 states have call successors, (86) [2024-10-14 02:50:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 853 transitions. [2024-10-14 02:50:19,658 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 853 transitions. Word has length 59 [2024-10-14 02:50:19,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:19,658 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 853 transitions. [2024-10-14 02:50:19,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:50:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 853 transitions. [2024-10-14 02:50:19,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 02:50:19,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:19,660 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:50:19,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 02:50:19,660 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:19,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:19,661 INFO L85 PathProgramCache]: Analyzing trace with hash -746415846, now seen corresponding path program 1 times [2024-10-14 02:50:19,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:19,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353825976] [2024-10-14 02:50:19,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:19,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:19,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:19,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:19,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:50:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:50:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:50:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:50:20,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:20,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353825976] [2024-10-14 02:50:20,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353825976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:20,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:20,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:50:20,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965028800] [2024-10-14 02:50:20,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:20,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:50:20,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:20,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:50:20,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:50:20,210 INFO L87 Difference]: Start difference. First operand 525 states and 853 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:50:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:23,617 INFO L93 Difference]: Finished difference Result 1157 states and 1925 transitions. [2024-10-14 02:50:23,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:50:23,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2024-10-14 02:50:23,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:23,621 INFO L225 Difference]: With dead ends: 1157 [2024-10-14 02:50:23,621 INFO L226 Difference]: Without dead ends: 691 [2024-10-14 02:50:23,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:50:23,623 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 671 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 2495 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 2613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:23,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 971 Invalid, 2613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2495 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-14 02:50:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-14 02:50:23,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 530. [2024-10-14 02:50:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 417 states have (on average 1.6378896882494005) internal successors, (683), 438 states have internal predecessors, (683), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (86), 82 states have call predecessors, (86), 84 states have call successors, (86) [2024-10-14 02:50:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 858 transitions. [2024-10-14 02:50:23,715 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 858 transitions. Word has length 65 [2024-10-14 02:50:23,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:23,715 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 858 transitions. [2024-10-14 02:50:23,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:50:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 858 transitions. [2024-10-14 02:50:23,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 02:50:23,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:23,718 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:50:23,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 02:50:23,719 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:23,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:23,719 INFO L85 PathProgramCache]: Analyzing trace with hash -619034897, now seen corresponding path program 1 times [2024-10-14 02:50:23,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:23,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949992376] [2024-10-14 02:50:23,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:23,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:23,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:23,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:24,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:50:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:24,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:24,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:24,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:50:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:24,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:50:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:50:24,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:24,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949992376] [2024-10-14 02:50:24,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949992376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:24,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:24,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 02:50:24,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283978256] [2024-10-14 02:50:24,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:24,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 02:50:24,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:24,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 02:50:24,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:50:24,285 INFO L87 Difference]: Start difference. First operand 530 states and 858 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8)