./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product22.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product22.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 10f09c8c5639b403d441157c6cb90f176690981c36f4af5417d0103735cbe364 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:37:28,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:37:28,741 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:37:28,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:37:28,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:37:28,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:37:28,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:37:28,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:37:28,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:37:28,789 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:37:28,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:37:28,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:37:28,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:37:28,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:37:28,791 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:37:28,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:37:28,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:37:28,795 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:37:28,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:37:28,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:37:28,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:37:28,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:37:28,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:37:28,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:37:28,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:37:28,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:37:28,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:37:28,802 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:37:28,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:37:28,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:37:28,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:37:28,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:37:28,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:37:28,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:37:28,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:37:28,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:37:28,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:37:28,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:37:28,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:37:28,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:37:28,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:37:28,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:37:28,809 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-clean/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-clean/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 -> 10f09c8c5639b403d441157c6cb90f176690981c36f4af5417d0103735cbe364 [2024-10-11 02:37:29,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:37:29,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:37:29,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:37:29,094 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:37:29,094 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:37:29,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product22.cil.c [2024-10-11 02:37:30,559 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:37:30,872 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:37:30,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product22.cil.c [2024-10-11 02:37:30,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ae4a5984e/daf063ef494246d7abb82acd2695fb36/FLAG71b82de5e [2024-10-11 02:37:31,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ae4a5984e/daf063ef494246d7abb82acd2695fb36 [2024-10-11 02:37:31,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:37:31,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:37:31,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:37:31,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:37:31,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:37:31,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:37:31" (1/1) ... [2024-10-11 02:37:31,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18ccebb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:31, skipping insertion in model container [2024-10-11 02:37:31,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:37:31" (1/1) ... [2024-10-11 02:37:31,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:37:31,441 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product22.cil.c[3205,3218] [2024-10-11 02:37:31,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:37:31,770 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:37:31,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2024-10-11 02:37:31,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [150] [2024-10-11 02:37:31,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [159] [2024-10-11 02:37:31,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [525] [2024-10-11 02:37:31,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [563] [2024-10-11 02:37:31,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [752] [2024-10-11 02:37:31,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1102] [2024-10-11 02:37:31,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1769] [2024-10-11 02:37:31,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1784] [2024-10-11 02:37:31,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1904] [2024-10-11 02:37:31,792 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product22.cil.c[3205,3218] [2024-10-11 02:37:31,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:37:32,021 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:37:32,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:32 WrapperNode [2024-10-11 02:37:32,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:37:32,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:37:32,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:37:32,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:37:32,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:32" (1/1) ... [2024-10-11 02:37:32,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:32" (1/1) ... [2024-10-11 02:37:32,100 INFO L138 Inliner]: procedures = 92, calls = 351, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 904 [2024-10-11 02:37:32,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:37:32,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:37:32,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:37:32,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:37:32,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:32" (1/1) ... [2024-10-11 02:37:32,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:32" (1/1) ... [2024-10-11 02:37:32,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:32" (1/1) ... [2024-10-11 02:37:32,153 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-11 02:37:32,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:32" (1/1) ... [2024-10-11 02:37:32,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:32" (1/1) ... [2024-10-11 02:37:32,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:32" (1/1) ... [2024-10-11 02:37:32,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:32" (1/1) ... [2024-10-11 02:37:32,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:32" (1/1) ... [2024-10-11 02:37:32,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:32" (1/1) ... [2024-10-11 02:37:32,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:37:32,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:37:32,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:37:32,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:37:32,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:32" (1/1) ... [2024-10-11 02:37:32,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:37:32,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:37:32,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:37:32,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:37:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:37:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-10-11 02:37:32,331 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-10-11 02:37:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:37:32,332 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:37:32,332 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:37:32,332 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:37:32,332 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:37:32,333 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:37:32,333 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-11 02:37:32,333 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-11 02:37:32,333 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:37:32,334 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:37:32,334 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:37:32,334 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:37:32,335 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:37:32,335 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:37:32,335 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:37:32,335 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:37:32,335 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:37:32,335 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:37:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:37:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:37:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:37:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:37:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-11 02:37:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-11 02:37:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-10-11 02:37:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-10-11 02:37:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:37:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:37:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-10-11 02:37:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-10-11 02:37:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:37:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:37:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:37:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:37:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:37:32,338 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:37:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:37:32,338 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:37:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:37:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:37:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:37:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:37:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:37:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:37:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:37:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:37:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:37:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:37:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:37:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:37:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:37:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:37:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:37:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:37:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:37:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:37:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:37:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:37:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-11 02:37:32,340 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-11 02:37:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:37:32,340 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:37:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:37:32,341 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:37:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:37:32,341 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:37:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2024-10-11 02:37:32,341 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2024-10-11 02:37:32,342 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2024-10-11 02:37:32,342 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2024-10-11 02:37:32,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:37:32,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:37:32,342 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:37:32,342 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:37:32,533 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:37:32,535 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:37:33,789 INFO L? ?]: Removed 462 outVars from TransFormulas that were not future-live. [2024-10-11 02:37:33,789 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:37:33,924 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:37:33,924 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:37:33,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:37:33 BoogieIcfgContainer [2024-10-11 02:37:33,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:37:33,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:37:33,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:37:33,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:37:33,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:37:31" (1/3) ... [2024-10-11 02:37:33,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e06d340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:37:33, skipping insertion in model container [2024-10-11 02:37:33,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:32" (2/3) ... [2024-10-11 02:37:33,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e06d340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:37:33, skipping insertion in model container [2024-10-11 02:37:33,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:37:33" (3/3) ... [2024-10-11 02:37:33,934 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product22.cil.c [2024-10-11 02:37:33,952 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:37:33,952 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:37:34,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:37:34,043 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;@316a8ba6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:37:34,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:37:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 574 states, 437 states have (on average 1.7070938215102975) internal successors, (746), 457 states have internal predecessors, (746), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-11 02:37:34,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 02:37:34,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:34,071 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:34,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:34,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:34,079 INFO L85 PathProgramCache]: Analyzing trace with hash 482654503, now seen corresponding path program 1 times [2024-10-11 02:37:34,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:34,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647076575] [2024-10-11 02:37:34,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:34,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:35,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:35,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:35,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:35,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:35,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:35,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:37:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:35,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:37:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:35,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:37:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:35,512 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-11 02:37:35,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:35,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647076575] [2024-10-11 02:37:35,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647076575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:35,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:35,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:37:35,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887693417] [2024-10-11 02:37:35,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:35,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:37:35,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:35,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:37:35,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:37:35,559 INFO L87 Difference]: Start difference. First operand has 574 states, 437 states have (on average 1.7070938215102975) internal successors, (746), 457 states have internal predecessors, (746), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:37:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:43,419 INFO L93 Difference]: Finished difference Result 1414 states and 2463 transitions. [2024-10-11 02:37:43,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:37:43,421 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 56 [2024-10-11 02:37:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:43,447 INFO L225 Difference]: With dead ends: 1414 [2024-10-11 02:37:43,447 INFO L226 Difference]: Without dead ends: 841 [2024-10-11 02:37:43,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:37:43,467 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 889 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 5171 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 2478 SdHoareTripleChecker+Invalid, 5372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 5171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:43,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 2478 Invalid, 5372 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [201 Valid, 5171 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-11 02:37:43,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2024-10-11 02:37:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 580. [2024-10-11 02:37:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 443 states have (on average 1.693002257336343) internal successors, (750), 463 states have internal predecessors, (750), 109 states have call successors, (109), 27 states have call predecessors, (109), 27 states have return successors, (108), 103 states have call predecessors, (108), 106 states have call successors, (108) [2024-10-11 02:37:43,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 967 transitions. [2024-10-11 02:37:43,684 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 967 transitions. Word has length 56 [2024-10-11 02:37:43,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:43,685 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 967 transitions. [2024-10-11 02:37:43,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:37:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 967 transitions. [2024-10-11 02:37:43,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 02:37:43,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:43,692 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:43,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:37:43,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:43,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:43,693 INFO L85 PathProgramCache]: Analyzing trace with hash -385066209, now seen corresponding path program 1 times [2024-10-11 02:37:43,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:43,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025390332] [2024-10-11 02:37:43,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:43,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:44,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:44,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:44,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:44,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:44,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:37:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:44,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:37:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:44,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:37:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:44,492 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-11 02:37:44,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:44,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025390332] [2024-10-11 02:37:44,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025390332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:44,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:44,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:37:44,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743912249] [2024-10-11 02:37:44,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:44,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:37:44,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:44,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:37:44,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:37:44,496 INFO L87 Difference]: Start difference. First operand 580 states and 967 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:37:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:51,194 INFO L93 Difference]: Finished difference Result 1411 states and 2430 transitions. [2024-10-11 02:37:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:37:51,195 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 57 [2024-10-11 02:37:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:51,202 INFO L225 Difference]: With dead ends: 1411 [2024-10-11 02:37:51,203 INFO L226 Difference]: Without dead ends: 841 [2024-10-11 02:37:51,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:37:51,207 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 850 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 5215 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 5411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 5215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:51,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 2377 Invalid, 5411 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [196 Valid, 5215 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-10-11 02:37:51,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2024-10-11 02:37:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 580. [2024-10-11 02:37:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 443 states have (on average 1.690744920993228) internal successors, (749), 463 states have internal predecessors, (749), 109 states have call successors, (109), 27 states have call predecessors, (109), 27 states have return successors, (108), 103 states have call predecessors, (108), 106 states have call successors, (108) [2024-10-11 02:37:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 966 transitions. [2024-10-11 02:37:51,393 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 966 transitions. Word has length 57 [2024-10-11 02:37:51,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:51,393 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 966 transitions. [2024-10-11 02:37:51,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:37:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 966 transitions. [2024-10-11 02:37:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 02:37:51,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:51,397 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:51,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:37:51,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:51,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:51,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1690840347, now seen corresponding path program 1 times [2024-10-11 02:37:51,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:51,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931855182] [2024-10-11 02:37:51,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:51,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:51,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:51,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:51,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:51,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:51,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:37:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:51,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:37:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:51,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:37:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:51,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:37:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:51,925 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-11 02:37:51,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:51,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931855182] [2024-10-11 02:37:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931855182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:51,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:51,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:37:51,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259892551] [2024-10-11 02:37:51,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:51,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:37:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:51,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:37:51,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:37:51,928 INFO L87 Difference]: Start difference. First operand 580 states and 966 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:37:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:56,724 INFO L93 Difference]: Finished difference Result 1405 states and 2413 transitions. [2024-10-11 02:37:56,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:37:56,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2024-10-11 02:37:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:56,733 INFO L225 Difference]: With dead ends: 1405 [2024-10-11 02:37:56,734 INFO L226 Difference]: Without dead ends: 806 [2024-10-11 02:37:56,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:37:56,739 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 801 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 2805 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 2993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 2805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:56,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1387 Invalid, 2993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 2805 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-11 02:37:56,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-10-11 02:37:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 557. [2024-10-11 02:37:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 423 states have (on average 1.6808510638297873) internal successors, (711), 441 states have internal predecessors, (711), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-11 02:37:56,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 924 transitions. [2024-10-11 02:37:56,861 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 924 transitions. Word has length 57 [2024-10-11 02:37:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:56,861 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 924 transitions. [2024-10-11 02:37:56,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:37:56,861 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 924 transitions. [2024-10-11 02:37:56,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 02:37:56,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:56,863 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:56,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:37:56,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:56,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:56,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1474161499, now seen corresponding path program 1 times [2024-10-11 02:37:56,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:56,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670126134] [2024-10-11 02:37:56,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:56,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:57,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:57,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:57,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:57,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:57,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:57,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:37:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:57,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:37:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:57,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:37:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:57,426 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-11 02:37:57,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:57,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670126134] [2024-10-11 02:37:57,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670126134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:57,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:57,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:37:57,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895261628] [2024-10-11 02:37:57,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:57,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:37:57,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:57,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:37:57,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:37:57,429 INFO L87 Difference]: Start difference. First operand 557 states and 924 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:03,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:03,199 INFO L93 Difference]: Finished difference Result 1369 states and 2345 transitions. [2024-10-11 02:38:03,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:03,199 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 58 [2024-10-11 02:38:03,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:03,206 INFO L225 Difference]: With dead ends: 1369 [2024-10-11 02:38:03,206 INFO L226 Difference]: Without dead ends: 800 [2024-10-11 02:38:03,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:38:03,212 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 844 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 5057 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 2541 SdHoareTripleChecker+Invalid, 5246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 5057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:03,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 2541 Invalid, 5246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 5057 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 02:38:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-10-11 02:38:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 551. [2024-10-11 02:38:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 417 states have (on average 1.6738609112709832) internal successors, (698), 435 states have internal predecessors, (698), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-11 02:38:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 911 transitions. [2024-10-11 02:38:03,305 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 911 transitions. Word has length 58 [2024-10-11 02:38:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:03,306 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 911 transitions. [2024-10-11 02:38:03,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 911 transitions. [2024-10-11 02:38:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 02:38:03,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:03,307 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:03,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:38:03,308 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:03,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:03,308 INFO L85 PathProgramCache]: Analyzing trace with hash -195121801, now seen corresponding path program 1 times [2024-10-11 02:38:03,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:03,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327429507] [2024-10-11 02:38:03,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:03,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:38:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:38:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:38:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,917 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-11 02:38:03,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:03,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327429507] [2024-10-11 02:38:03,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327429507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:03,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:03,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:38:03,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695902846] [2024-10-11 02:38:03,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:03,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:38:03,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:03,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:38:03,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:38:03,923 INFO L87 Difference]: Start difference. First operand 551 states and 911 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, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:38:07,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:07,790 INFO L93 Difference]: Finished difference Result 1341 states and 2296 transitions. [2024-10-11 02:38:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:38:07,791 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, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 59 [2024-10-11 02:38:07,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:07,797 INFO L225 Difference]: With dead ends: 1341 [2024-10-11 02:38:07,797 INFO L226 Difference]: Without dead ends: 800 [2024-10-11 02:38:07,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:38:07,801 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1358 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:07,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1275 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:38:07,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-10-11 02:38:07,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 551. [2024-10-11 02:38:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 417 states have (on average 1.671462829736211) internal successors, (697), 435 states have internal predecessors, (697), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-11 02:38:07,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 910 transitions. [2024-10-11 02:38:07,892 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 910 transitions. Word has length 59 [2024-10-11 02:38:07,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:07,892 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 910 transitions. [2024-10-11 02:38:07,893 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, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:38:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 910 transitions. [2024-10-11 02:38:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 02:38:07,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:07,894 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:07,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:38:07,896 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:07,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:07,896 INFO L85 PathProgramCache]: Analyzing trace with hash -395003746, now seen corresponding path program 1 times [2024-10-11 02:38:07,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:07,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165074232] [2024-10-11 02:38:07,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:07,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:38:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:38:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:38:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,523 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-11 02:38:08,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:08,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165074232] [2024-10-11 02:38:08,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165074232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:08,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:08,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:08,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957011720] [2024-10-11 02:38:08,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:08,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:08,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:08,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:08,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:08,525 INFO L87 Difference]: Start difference. First operand 551 states and 910 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:14,179 INFO L93 Difference]: Finished difference Result 1357 states and 2314 transitions. [2024-10-11 02:38:14,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:14,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2024-10-11 02:38:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:14,186 INFO L225 Difference]: With dead ends: 1357 [2024-10-11 02:38:14,186 INFO L226 Difference]: Without dead ends: 794 [2024-10-11 02:38:14,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:38:14,189 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 1415 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 4707 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 2122 SdHoareTripleChecker+Invalid, 5133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 4707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:14,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 2122 Invalid, 5133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 4707 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 02:38:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-10-11 02:38:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 545. [2024-10-11 02:38:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 411 states have (on average 1.6642335766423357) internal successors, (684), 429 states have internal predecessors, (684), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-11 02:38:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 897 transitions. [2024-10-11 02:38:14,286 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 897 transitions. Word has length 60 [2024-10-11 02:38:14,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:14,287 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 897 transitions. [2024-10-11 02:38:14,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 897 transitions. [2024-10-11 02:38:14,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 02:38:14,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:14,289 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:14,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:38:14,289 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:14,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:14,290 INFO L85 PathProgramCache]: Analyzing trace with hash 392915478, now seen corresponding path program 1 times [2024-10-11 02:38:14,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:14,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672464776] [2024-10-11 02:38:14,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:14,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:14,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:14,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:14,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:14,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:14,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:14,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:38:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:14,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 02:38:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:14,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:38:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:14,859 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-11 02:38:14,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:14,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672464776] [2024-10-11 02:38:14,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672464776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:14,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:14,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:38:14,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604420137] [2024-10-11 02:38:14,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:14,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:38:14,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:14,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:38:14,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:38:14,861 INFO L87 Difference]: Start difference. First operand 545 states and 897 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, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:38:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:18,704 INFO L93 Difference]: Finished difference Result 1329 states and 2267 transitions. [2024-10-11 02:38:18,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:38:18,705 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, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2024-10-11 02:38:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:18,709 INFO L225 Difference]: With dead ends: 1329 [2024-10-11 02:38:18,710 INFO L226 Difference]: Without dead ends: 794 [2024-10-11 02:38:18,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:38:18,713 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 1371 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 2417 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 2417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:18,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 1130 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 2417 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:38:18,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-10-11 02:38:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 545. [2024-10-11 02:38:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 411 states have (on average 1.661800486618005) internal successors, (683), 429 states have internal predecessors, (683), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-11 02:38:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 896 transitions. [2024-10-11 02:38:18,810 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 896 transitions. Word has length 61 [2024-10-11 02:38:18,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:18,811 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 896 transitions. [2024-10-11 02:38:18,811 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, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:38:18,811 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 896 transitions. [2024-10-11 02:38:18,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 02:38:18,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:18,812 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:18,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:38:18,813 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:18,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:18,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1486775418, now seen corresponding path program 1 times [2024-10-11 02:38:18,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:18,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552902424] [2024-10-11 02:38:18,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:18,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:19,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:19,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:19,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:19,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:19,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:19,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:38:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:19,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:38:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:19,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:38:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:19,353 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-11 02:38:19,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:19,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552902424] [2024-10-11 02:38:19,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552902424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:19,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:19,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:19,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126780092] [2024-10-11 02:38:19,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:19,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:19,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:19,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:19,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:19,355 INFO L87 Difference]: Start difference. First operand 545 states and 896 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:24,905 INFO L93 Difference]: Finished difference Result 1345 states and 2283 transitions. [2024-10-11 02:38:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:24,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2024-10-11 02:38:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:24,911 INFO L225 Difference]: With dead ends: 1345 [2024-10-11 02:38:24,911 INFO L226 Difference]: Without dead ends: 788 [2024-10-11 02:38:24,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:38:24,914 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 798 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 4759 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 2195 SdHoareTripleChecker+Invalid, 4961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 4759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:24,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 2195 Invalid, 4961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 4759 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 02:38:24,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-10-11 02:38:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 539. [2024-10-11 02:38:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 405 states have (on average 1.654320987654321) internal successors, (670), 423 states have internal predecessors, (670), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-11 02:38:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 883 transitions. [2024-10-11 02:38:25,013 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 883 transitions. Word has length 62 [2024-10-11 02:38:25,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:25,013 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 883 transitions. [2024-10-11 02:38:25,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 883 transitions. [2024-10-11 02:38:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 02:38:25,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:25,014 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:25,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:38:25,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:25,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:25,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1706700795, now seen corresponding path program 1 times [2024-10-11 02:38:25,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:25,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526522030] [2024-10-11 02:38:25,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:25,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:38:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:38:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:38:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,577 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-11 02:38:25,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:25,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526522030] [2024-10-11 02:38:25,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526522030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:25,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:25,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:25,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175265885] [2024-10-11 02:38:25,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:25,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:25,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:25,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:25,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:25,583 INFO L87 Difference]: Start difference. First operand 539 states and 883 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:30,603 INFO L93 Difference]: Finished difference Result 1317 states and 2238 transitions. [2024-10-11 02:38:30,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:38:30,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2024-10-11 02:38:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:30,609 INFO L225 Difference]: With dead ends: 1317 [2024-10-11 02:38:30,610 INFO L226 Difference]: Without dead ends: 788 [2024-10-11 02:38:30,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:38:30,613 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 1339 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 4500 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 2104 SdHoareTripleChecker+Invalid, 4925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 4500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:30,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 2104 Invalid, 4925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 4500 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 02:38:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-10-11 02:38:30,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 539. [2024-10-11 02:38:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 405 states have (on average 1.651851851851852) internal successors, (669), 423 states have internal predecessors, (669), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-11 02:38:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 882 transitions. [2024-10-11 02:38:30,732 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 882 transitions. Word has length 62 [2024-10-11 02:38:30,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:30,732 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 882 transitions. [2024-10-11 02:38:30,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 882 transitions. [2024-10-11 02:38:30,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 02:38:30,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:30,736 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:30,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:38:30,737 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:30,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:30,737 INFO L85 PathProgramCache]: Analyzing trace with hash 96939984, now seen corresponding path program 1 times [2024-10-11 02:38:30,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:30,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983123689] [2024-10-11 02:38:30,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:30,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:38:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:38:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:38:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,328 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-11 02:38:31,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:31,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983123689] [2024-10-11 02:38:31,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983123689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:31,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:31,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:31,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349515306] [2024-10-11 02:38:31,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:31,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:31,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:31,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:31,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:31,330 INFO L87 Difference]: Start difference. First operand 539 states and 882 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:36,444 INFO L93 Difference]: Finished difference Result 1323 states and 2242 transitions. [2024-10-11 02:38:36,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:38:36,444 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2024-10-11 02:38:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:36,449 INFO L225 Difference]: With dead ends: 1323 [2024-10-11 02:38:36,449 INFO L226 Difference]: Without dead ends: 794 [2024-10-11 02:38:36,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:38:36,451 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1317 mSDsluCounter, 2060 mSDsCounter, 0 mSdLazyCounter, 4651 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 5040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 4651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:36,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1425 Valid, 2488 Invalid, 5040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 4651 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 02:38:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-10-11 02:38:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 545. [2024-10-11 02:38:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 411 states have (on average 1.6423357664233578) internal successors, (675), 429 states have internal predecessors, (675), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-11 02:38:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 888 transitions. [2024-10-11 02:38:36,545 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 888 transitions. Word has length 63 [2024-10-11 02:38:36,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:36,545 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 888 transitions. [2024-10-11 02:38:36,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 888 transitions. [2024-10-11 02:38:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 02:38:36,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:36,547 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:36,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:38:36,547 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:36,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:36,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2147043314, now seen corresponding path program 1 times [2024-10-11 02:38:36,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:36,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343700539] [2024-10-11 02:38:36,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:36,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:36,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:36,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:38:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:38:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:38:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,100 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-11 02:38:37,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:37,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343700539] [2024-10-11 02:38:37,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343700539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:37,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:37,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:37,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288302770] [2024-10-11 02:38:37,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:37,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:37,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:37,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:37,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:37,103 INFO L87 Difference]: Start difference. First operand 545 states and 888 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:42,529 INFO L93 Difference]: Finished difference Result 1331 states and 2248 transitions. [2024-10-11 02:38:42,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:38:42,529 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2024-10-11 02:38:42,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:42,534 INFO L225 Difference]: With dead ends: 1331 [2024-10-11 02:38:42,535 INFO L226 Difference]: Without dead ends: 788 [2024-10-11 02:38:42,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:38:42,537 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 770 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 4708 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 4899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 4708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:42,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 2516 Invalid, 4899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 4708 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 02:38:42,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-10-11 02:38:42,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 539. [2024-10-11 02:38:42,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 405 states have (on average 1.6493827160493828) internal successors, (668), 423 states have internal predecessors, (668), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-11 02:38:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 881 transitions. [2024-10-11 02:38:42,638 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 881 transitions. Word has length 63 [2024-10-11 02:38:42,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:42,639 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 881 transitions. [2024-10-11 02:38:42,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 881 transitions. [2024-10-11 02:38:42,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 02:38:42,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:42,640 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:42,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:38:42,640 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:42,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:42,641 INFO L85 PathProgramCache]: Analyzing trace with hash -443177451, now seen corresponding path program 1 times [2024-10-11 02:38:42,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:42,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615239977] [2024-10-11 02:38:42,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:42,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:42,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:43,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:43,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:43,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:43,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:43,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:38:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:43,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:38:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:43,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:38:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 02:38:43,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:43,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615239977] [2024-10-11 02:38:43,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615239977] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:38:43,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649266834] [2024-10-11 02:38:43,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:43,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:38:43,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:38:43,197 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:38:43,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:38:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:43,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 1471 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:38:43,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:38:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:38:43,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:38:43,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649266834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:43,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:38:43,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:38:43,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626401622] [2024-10-11 02:38:43,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:43,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:38:43,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:43,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:38:43,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:43,564 INFO L87 Difference]: Start difference. First operand 539 states and 881 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:43,799 INFO L93 Difference]: Finished difference Result 1540 states and 2543 transitions. [2024-10-11 02:38:43,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:38:43,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 64 [2024-10-11 02:38:43,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:43,807 INFO L225 Difference]: With dead ends: 1540 [2024-10-11 02:38:43,807 INFO L226 Difference]: Without dead ends: 1013 [2024-10-11 02:38:43,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:43,810 INFO L432 NwaCegarLoop]: 875 mSDtfsCounter, 846 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:43,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 1644 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:38:43,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2024-10-11 02:38:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 999. [2024-10-11 02:38:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 759 states have (on average 1.6587615283267456) internal successors, (1259), 794 states have internal predecessors, (1259), 191 states have call successors, (191), 49 states have call predecessors, (191), 48 states have return successors, (193), 183 states have call predecessors, (193), 188 states have call successors, (193) [2024-10-11 02:38:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1643 transitions. [2024-10-11 02:38:44,008 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1643 transitions. Word has length 64 [2024-10-11 02:38:44,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:44,008 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1643 transitions. [2024-10-11 02:38:44,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1643 transitions. [2024-10-11 02:38:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 02:38:44,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:44,010 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-11 02:38:44,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:38:44,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 02:38:44,215 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:44,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:44,215 INFO L85 PathProgramCache]: Analyzing trace with hash 849577462, now seen corresponding path program 1 times [2024-10-11 02:38:44,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:44,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078194669] [2024-10-11 02:38:44,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:44,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:38:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:38:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:38:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 02:38:44,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078194669] [2024-10-11 02:38:44,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078194669] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:38:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922568031] [2024-10-11 02:38:44,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:44,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:38:44,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:38:44,719 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:38:44,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:38:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:38:44,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:38:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:38:45,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:38:45,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922568031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:45,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:38:45,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:38:45,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986404851] [2024-10-11 02:38:45,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:45,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:38:45,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:45,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:38:45,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:45,024 INFO L87 Difference]: Start difference. First operand 999 states and 1643 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:45,347 INFO L93 Difference]: Finished difference Result 2460 states and 4069 transitions. [2024-10-11 02:38:45,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:38:45,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 65 [2024-10-11 02:38:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:45,357 INFO L225 Difference]: With dead ends: 2460 [2024-10-11 02:38:45,357 INFO L226 Difference]: Without dead ends: 1473 [2024-10-11 02:38:45,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:45,362 INFO L432 NwaCegarLoop]: 926 mSDtfsCounter, 845 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:45,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 1695 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:38:45,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2024-10-11 02:38:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1427. [2024-10-11 02:38:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1087 states have (on average 1.6697332106715732) internal successors, (1815), 1139 states have internal predecessors, (1815), 271 states have call successors, (271), 68 states have call predecessors, (271), 68 states have return successors, (278), 261 states have call predecessors, (278), 268 states have call successors, (278) [2024-10-11 02:38:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2364 transitions. [2024-10-11 02:38:45,633 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 2364 transitions. Word has length 65 [2024-10-11 02:38:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:45,634 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 2364 transitions. [2024-10-11 02:38:45,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 2364 transitions. [2024-10-11 02:38:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 02:38:45,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:45,635 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:45,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:38:45,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:38:45,836 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:45,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:45,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1962651416, now seen corresponding path program 1 times [2024-10-11 02:38:45,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:45,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366058664] [2024-10-11 02:38:45,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:45,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:46,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:46,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:46,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:46,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:46,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:46,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:38:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:46,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:38:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:46,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:38:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:46,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:38:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:46,396 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-11 02:38:46,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:46,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366058664] [2024-10-11 02:38:46,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366058664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:46,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:46,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:38:46,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016506777] [2024-10-11 02:38:46,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:46,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:38:46,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:46,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:38:46,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:38:46,398 INFO L87 Difference]: Start difference. First operand 1427 states and 2364 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9)