./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5c5409edee222b3f26bc580399bcb562d4fe1c01c7706a6bada265380f08e33c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:33:41,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:33:41,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:33:41,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:33:41,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:33:41,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:33:41,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:33:41,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:33:41,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:33:41,374 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:33:41,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:33:41,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:33:41,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:33:41,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:33:41,375 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:33:41,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:33:41,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:33:41,376 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:33:41,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:33:41,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:33:41,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:33:41,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:33:41,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:33:41,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:33:41,382 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:33:41,382 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:33:41,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:33:41,382 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:33:41,383 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:33:41,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:33:41,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:33:41,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:33:41,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:33:41,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:33:41,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:33:41,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:33:41,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:33:41,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:33:41,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:33:41,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:33:41,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:33:41,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:33:41,387 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5c5409edee222b3f26bc580399bcb562d4fe1c01c7706a6bada265380f08e33c [2024-11-19 00:33:41,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:33:41,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:33:41,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:33:41,686 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:33:41,687 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:33:41,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i [2024-11-19 00:33:43,137 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:33:43,401 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:33:43,401 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i [2024-11-19 00:33:43,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd47456bb/bf9d8e90fdf3430dbb89287384f20142/FLAG342d1d412 [2024-11-19 00:33:43,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd47456bb/bf9d8e90fdf3430dbb89287384f20142 [2024-11-19 00:33:43,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:33:43,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:33:43,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:33:43,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:33:43,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:33:43,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:33:43" (1/1) ... [2024-11-19 00:33:43,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ff4c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:43, skipping insertion in model container [2024-11-19 00:33:43,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:33:43" (1/1) ... [2024-11-19 00:33:43,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:33:43,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i[915,928] [2024-11-19 00:33:43,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:33:43,711 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:33:43,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i[915,928] [2024-11-19 00:33:43,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:33:43,797 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:33:43,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:43 WrapperNode [2024-11-19 00:33:43,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:33:43,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:33:43,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:33:43,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:33:43,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:43" (1/1) ... [2024-11-19 00:33:43,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:43" (1/1) ... [2024-11-19 00:33:43,865 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 629 [2024-11-19 00:33:43,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:33:43,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:33:43,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:33:43,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:33:43,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:43" (1/1) ... [2024-11-19 00:33:43,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:43" (1/1) ... [2024-11-19 00:33:43,884 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:43" (1/1) ... [2024-11-19 00:33:43,911 INFO L175 MemorySlicer]: Split 151 memory accesses to 4 slices as follows [2, 31, 75, 43]. 50 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 5, 5]. The 17 writes are split as follows [0, 5, 6, 6]. [2024-11-19 00:33:43,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:43" (1/1) ... [2024-11-19 00:33:43,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:43" (1/1) ... [2024-11-19 00:33:43,941 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:43" (1/1) ... [2024-11-19 00:33:43,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:43" (1/1) ... [2024-11-19 00:33:43,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:43" (1/1) ... [2024-11-19 00:33:43,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:43" (1/1) ... [2024-11-19 00:33:43,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:33:43,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:33:43,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:33:43,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:33:43,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:43" (1/1) ... [2024-11-19 00:33:43,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:33:43,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:33:44,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:33:44,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:33:44,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:33:44,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:33:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:33:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:33:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:33:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:33:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:33:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:33:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:33:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:33:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:33:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:33:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:33:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:33:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:33:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:33:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:33:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:33:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:33:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:33:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:33:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:33:44,068 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:33:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:33:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:33:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:33:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:33:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:33:44,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:33:44,228 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:33:44,230 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:33:44,841 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2024-11-19 00:33:44,842 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:33:44,893 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:33:44,894 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:33:44,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:33:44 BoogieIcfgContainer [2024-11-19 00:33:44,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:33:44,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:33:44,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:33:44,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:33:44,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:33:43" (1/3) ... [2024-11-19 00:33:44,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3577052c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:33:44, skipping insertion in model container [2024-11-19 00:33:44,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:43" (2/3) ... [2024-11-19 00:33:44,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3577052c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:33:44, skipping insertion in model container [2024-11-19 00:33:44,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:33:44" (3/3) ... [2024-11-19 00:33:44,905 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-3.i [2024-11-19 00:33:44,921 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:33:44,922 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:33:44,983 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:33:44,990 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;@1c41f72a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:33:44,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:33:44,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:33:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 00:33:45,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:45,010 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:45,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:45,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:45,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1274553811, now seen corresponding path program 1 times [2024-11-19 00:33:45,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:45,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100483805] [2024-11-19 00:33:45,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:45,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-19 00:33:45,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:45,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100483805] [2024-11-19 00:33:45,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100483805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:33:45,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564620969] [2024-11-19 00:33:45,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:45,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:33:45,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:33:45,376 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:33:45,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:33:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:45,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:33:45,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:33:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-19 00:33:45,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:33:45,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564620969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:45,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:33:45,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:33:45,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500733718] [2024-11-19 00:33:45,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:45,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:33:45,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:45,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:33:45,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:33:45,713 INFO L87 Difference]: Start difference. First operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:33:45,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:45,744 INFO L93 Difference]: Finished difference Result 291 states and 454 transitions. [2024-11-19 00:33:45,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:33:45,747 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-19 00:33:45,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:45,753 INFO L225 Difference]: With dead ends: 291 [2024-11-19 00:33:45,753 INFO L226 Difference]: Without dead ends: 145 [2024-11-19 00:33:45,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:33:45,763 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:45,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:33:45,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-19 00:33:45,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-19 00:33:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4409448818897639) internal successors, (183), 127 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:33:45,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2024-11-19 00:33:45,811 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 133 [2024-11-19 00:33:45,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:45,812 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2024-11-19 00:33:45,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:33:45,813 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2024-11-19 00:33:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 00:33:45,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:45,819 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:45,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:33:46,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:33:46,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:46,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:46,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1186476437, now seen corresponding path program 1 times [2024-11-19 00:33:46,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:46,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848535666] [2024-11-19 00:33:46,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:46,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:46,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:46,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848535666] [2024-11-19 00:33:46,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848535666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:46,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:46,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:33:46,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968576299] [2024-11-19 00:33:46,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:46,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:33:46,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:46,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:33:46,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:33:46,419 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:33:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:46,486 INFO L93 Difference]: Finished difference Result 289 states and 430 transitions. [2024-11-19 00:33:46,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:33:46,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-19 00:33:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:46,493 INFO L225 Difference]: With dead ends: 289 [2024-11-19 00:33:46,493 INFO L226 Difference]: Without dead ends: 147 [2024-11-19 00:33:46,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:33:46,499 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:46,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:33:46,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-19 00:33:46,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-19 00:33:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:33:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2024-11-19 00:33:46,523 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 133 [2024-11-19 00:33:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:46,525 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2024-11-19 00:33:46,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:33:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2024-11-19 00:33:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 00:33:46,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:46,530 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:46,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:33:46,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:46,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:46,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1149916073, now seen corresponding path program 1 times [2024-11-19 00:33:46,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:46,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487627261] [2024-11-19 00:33:46,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:46,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 00:33:46,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:46,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487627261] [2024-11-19 00:33:46,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487627261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:33:46,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087814820] [2024-11-19 00:33:46,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:46,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:33:46,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:33:46,876 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:33:46,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:33:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:47,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:33:47,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:33:47,179 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:47,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:33:47,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087814820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:47,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:33:47,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-19 00:33:47,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50766425] [2024-11-19 00:33:47,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:47,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:33:47,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:47,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:33:47,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:33:47,186 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:47,239 INFO L93 Difference]: Finished difference Result 293 states and 434 transitions. [2024-11-19 00:33:47,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:33:47,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-19 00:33:47,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:47,246 INFO L225 Difference]: With dead ends: 293 [2024-11-19 00:33:47,246 INFO L226 Difference]: Without dead ends: 149 [2024-11-19 00:33:47,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:33:47,249 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:47,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:33:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-19 00:33:47,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-19 00:33:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.4274809160305344) internal successors, (187), 131 states have internal predecessors, (187), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:33:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 219 transitions. [2024-11-19 00:33:47,275 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 219 transitions. Word has length 133 [2024-11-19 00:33:47,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:47,276 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 219 transitions. [2024-11-19 00:33:47,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 219 transitions. [2024-11-19 00:33:47,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 00:33:47,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:47,280 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:47,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:33:47,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-19 00:33:47,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:47,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:47,481 INFO L85 PathProgramCache]: Analyzing trace with hash -634850903, now seen corresponding path program 1 times [2024-11-19 00:33:47,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:47,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576899756] [2024-11-19 00:33:47,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:47,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:47,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:47,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576899756] [2024-11-19 00:33:47,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576899756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:47,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:47,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:33:47,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461634556] [2024-11-19 00:33:47,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:47,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:33:47,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:47,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:33:47,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:33:47,615 INFO L87 Difference]: Start difference. First operand 149 states and 219 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:47,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:47,653 INFO L93 Difference]: Finished difference Result 372 states and 550 transitions. [2024-11-19 00:33:47,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:33:47,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-19 00:33:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:47,657 INFO L225 Difference]: With dead ends: 372 [2024-11-19 00:33:47,657 INFO L226 Difference]: Without dead ends: 226 [2024-11-19 00:33:47,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:33:47,659 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 114 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:47,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 412 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:33:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-19 00:33:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 181. [2024-11-19 00:33:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 163 states have (on average 1.4478527607361964) internal successors, (236), 163 states have internal predecessors, (236), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:33:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 268 transitions. [2024-11-19 00:33:47,686 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 268 transitions. Word has length 135 [2024-11-19 00:33:47,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:47,686 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 268 transitions. [2024-11-19 00:33:47,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 268 transitions. [2024-11-19 00:33:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 00:33:47,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:47,688 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:47,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:33:47,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:47,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:47,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1812732430, now seen corresponding path program 1 times [2024-11-19 00:33:47,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:47,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427382345] [2024-11-19 00:33:47,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:47,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:48,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:48,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427382345] [2024-11-19 00:33:48,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427382345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:48,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:48,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:33:48,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522508022] [2024-11-19 00:33:48,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:48,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:33:48,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:48,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:33:48,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:33:48,131 INFO L87 Difference]: Start difference. First operand 181 states and 268 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:48,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:48,227 INFO L93 Difference]: Finished difference Result 537 states and 798 transitions. [2024-11-19 00:33:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:33:48,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-19 00:33:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:48,233 INFO L225 Difference]: With dead ends: 537 [2024-11-19 00:33:48,234 INFO L226 Difference]: Without dead ends: 359 [2024-11-19 00:33:48,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:33:48,236 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 158 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:48,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 783 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:33:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-19 00:33:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 351. [2024-11-19 00:33:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 316 states have (on average 1.4430379746835442) internal successors, (456), 316 states have internal predecessors, (456), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:33:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 520 transitions. [2024-11-19 00:33:48,275 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 520 transitions. Word has length 135 [2024-11-19 00:33:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:48,275 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 520 transitions. [2024-11-19 00:33:48,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 520 transitions. [2024-11-19 00:33:48,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 00:33:48,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:48,279 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:48,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:33:48,279 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:48,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:48,280 INFO L85 PathProgramCache]: Analyzing trace with hash 872276686, now seen corresponding path program 1 times [2024-11-19 00:33:48,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:48,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818787228] [2024-11-19 00:33:48,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:48,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:49,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:49,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818787228] [2024-11-19 00:33:49,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818787228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:49,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:49,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:33:49,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602928227] [2024-11-19 00:33:49,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:49,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:33:49,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:49,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:33:49,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:33:49,370 INFO L87 Difference]: Start difference. First operand 351 states and 520 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:33:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:49,650 INFO L93 Difference]: Finished difference Result 679 states and 1006 transitions. [2024-11-19 00:33:49,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:33:49,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-11-19 00:33:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:49,654 INFO L225 Difference]: With dead ends: 679 [2024-11-19 00:33:49,654 INFO L226 Difference]: Without dead ends: 501 [2024-11-19 00:33:49,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:33:49,656 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 172 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:49,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1965 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:33:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-19 00:33:49,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 498. [2024-11-19 00:33:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 450 states have (on average 1.4444444444444444) internal successors, (650), 451 states have internal predecessors, (650), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-19 00:33:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 738 transitions. [2024-11-19 00:33:49,682 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 738 transitions. Word has length 136 [2024-11-19 00:33:49,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:49,683 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 738 transitions. [2024-11-19 00:33:49,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:33:49,683 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 738 transitions. [2024-11-19 00:33:49,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:33:49,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:49,685 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:49,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:33:49,685 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:49,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:49,686 INFO L85 PathProgramCache]: Analyzing trace with hash -844346088, now seen corresponding path program 1 times [2024-11-19 00:33:49,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:49,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900725168] [2024-11-19 00:33:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:49,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:50,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:50,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900725168] [2024-11-19 00:33:50,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900725168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:50,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:50,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:33:50,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448639962] [2024-11-19 00:33:50,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:50,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:33:50,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:50,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:33:50,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:33:50,062 INFO L87 Difference]: Start difference. First operand 498 states and 738 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:50,242 INFO L93 Difference]: Finished difference Result 1001 states and 1484 transitions. [2024-11-19 00:33:50,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:33:50,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-19 00:33:50,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:50,248 INFO L225 Difference]: With dead ends: 1001 [2024-11-19 00:33:50,248 INFO L226 Difference]: Without dead ends: 506 [2024-11-19 00:33:50,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:33:50,251 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 148 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:50,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 929 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:33:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-19 00:33:50,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 498. [2024-11-19 00:33:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 450 states have (on average 1.4422222222222223) internal successors, (649), 451 states have internal predecessors, (649), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-19 00:33:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 737 transitions. [2024-11-19 00:33:50,273 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 737 transitions. Word has length 137 [2024-11-19 00:33:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:50,273 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 737 transitions. [2024-11-19 00:33:50,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 737 transitions. [2024-11-19 00:33:50,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:33:50,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:50,276 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:50,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:33:50,277 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:50,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1750132432, now seen corresponding path program 1 times [2024-11-19 00:33:50,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:50,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229760805] [2024-11-19 00:33:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:50,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 00:33:50,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:50,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229760805] [2024-11-19 00:33:50,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229760805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:33:50,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174342257] [2024-11-19 00:33:50,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:50,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:33:50,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:33:50,504 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:33:50,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:33:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:50,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:33:50,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:33:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:50,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:33:50,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174342257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:50,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:33:50,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-19 00:33:50,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590468618] [2024-11-19 00:33:50,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:50,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:33:50,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:50,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:33:50,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:33:50,783 INFO L87 Difference]: Start difference. First operand 498 states and 737 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:50,817 INFO L93 Difference]: Finished difference Result 1002 states and 1483 transitions. [2024-11-19 00:33:50,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:33:50,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-19 00:33:50,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:50,820 INFO L225 Difference]: With dead ends: 1002 [2024-11-19 00:33:50,821 INFO L226 Difference]: Without dead ends: 507 [2024-11-19 00:33:50,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:33:50,822 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:50,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 833 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:33:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-19 00:33:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 501. [2024-11-19 00:33:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 453 states have (on average 1.4392935982339956) internal successors, (652), 454 states have internal predecessors, (652), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-19 00:33:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 740 transitions. [2024-11-19 00:33:50,841 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 740 transitions. Word has length 137 [2024-11-19 00:33:50,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:50,842 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 740 transitions. [2024-11-19 00:33:50,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:50,842 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 740 transitions. [2024-11-19 00:33:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 00:33:50,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:50,844 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:50,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 00:33:51,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:33:51,046 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:51,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:51,046 INFO L85 PathProgramCache]: Analyzing trace with hash 994940217, now seen corresponding path program 1 times [2024-11-19 00:33:51,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:51,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291025175] [2024-11-19 00:33:51,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:51,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 00:33:51,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:51,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291025175] [2024-11-19 00:33:51,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291025175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:33:51,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913632553] [2024-11-19 00:33:51,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:51,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:33:51,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:33:51,265 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:33:51,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 00:33:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:51,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:33:51,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:33:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:51,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:33:51,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913632553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:51,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:33:51,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-19 00:33:51,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627080881] [2024-11-19 00:33:51,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:51,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:33:51,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:51,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:33:51,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:33:51,507 INFO L87 Difference]: Start difference. First operand 501 states and 740 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:51,540 INFO L93 Difference]: Finished difference Result 1008 states and 1489 transitions. [2024-11-19 00:33:51,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:33:51,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-19 00:33:51,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:51,543 INFO L225 Difference]: With dead ends: 1008 [2024-11-19 00:33:51,543 INFO L226 Difference]: Without dead ends: 510 [2024-11-19 00:33:51,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:33:51,545 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:51,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 832 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:33:51,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-11-19 00:33:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2024-11-19 00:33:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 462 states have (on average 1.4307359307359306) internal successors, (661), 463 states have internal predecessors, (661), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-19 00:33:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 749 transitions. [2024-11-19 00:33:51,565 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 749 transitions. Word has length 138 [2024-11-19 00:33:51,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:51,565 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 749 transitions. [2024-11-19 00:33:51,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 749 transitions. [2024-11-19 00:33:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 00:33:51,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:51,567 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:51,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 00:33:51,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:33:51,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:51,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:51,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2110809336, now seen corresponding path program 1 times [2024-11-19 00:33:51,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:51,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091691328] [2024-11-19 00:33:51,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:51,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:52,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:52,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091691328] [2024-11-19 00:33:52,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091691328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:52,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:52,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:33:52,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733628449] [2024-11-19 00:33:52,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:52,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:33:52,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:52,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:33:52,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:33:52,239 INFO L87 Difference]: Start difference. First operand 510 states and 749 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:52,562 INFO L93 Difference]: Finished difference Result 874 states and 1283 transitions. [2024-11-19 00:33:52,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:33:52,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-19 00:33:52,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:52,565 INFO L225 Difference]: With dead ends: 874 [2024-11-19 00:33:52,566 INFO L226 Difference]: Without dead ends: 541 [2024-11-19 00:33:52,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:33:52,568 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 401 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:52,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 949 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:33:52,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-19 00:33:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 533. [2024-11-19 00:33:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 480 states have (on average 1.4208333333333334) internal successors, (682), 480 states have internal predecessors, (682), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:33:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 778 transitions. [2024-11-19 00:33:52,598 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 778 transitions. Word has length 138 [2024-11-19 00:33:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:52,599 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 778 transitions. [2024-11-19 00:33:52,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 778 transitions. [2024-11-19 00:33:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 00:33:52,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:52,601 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:52,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:33:52,601 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:52,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:52,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1825930508, now seen corresponding path program 1 times [2024-11-19 00:33:52,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:52,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139164472] [2024-11-19 00:33:52,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:52,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:53,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:53,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139164472] [2024-11-19 00:33:53,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139164472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:53,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:53,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:33:53,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698266869] [2024-11-19 00:33:53,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:53,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:33:53,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:53,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:33:53,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:33:53,022 INFO L87 Difference]: Start difference. First operand 533 states and 778 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:53,305 INFO L93 Difference]: Finished difference Result 901 states and 1315 transitions. [2024-11-19 00:33:53,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:33:53,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-19 00:33:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:53,309 INFO L225 Difference]: With dead ends: 901 [2024-11-19 00:33:53,309 INFO L226 Difference]: Without dead ends: 545 [2024-11-19 00:33:53,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:33:53,311 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 398 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:53,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 934 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:33:53,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-19 00:33:53,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 363. [2024-11-19 00:33:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 327 states have (on average 1.4128440366972477) internal successors, (462), 327 states have internal predecessors, (462), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:33:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 526 transitions. [2024-11-19 00:33:53,330 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 526 transitions. Word has length 138 [2024-11-19 00:33:53,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:53,330 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 526 transitions. [2024-11-19 00:33:53,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 526 transitions. [2024-11-19 00:33:53,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 00:33:53,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:53,332 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:53,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:33:53,333 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:53,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:53,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1777113810, now seen corresponding path program 1 times [2024-11-19 00:33:53,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:53,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894798053] [2024-11-19 00:33:53,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:53,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:54,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:54,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894798053] [2024-11-19 00:33:54,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894798053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:54,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:54,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:33:54,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014830776] [2024-11-19 00:33:54,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:54,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:33:54,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:54,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:33:54,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:33:54,411 INFO L87 Difference]: Start difference. First operand 363 states and 526 transitions. Second operand has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-19 00:33:54,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:54,812 INFO L93 Difference]: Finished difference Result 872 states and 1264 transitions. [2024-11-19 00:33:54,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:33:54,813 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 139 [2024-11-19 00:33:54,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:54,815 INFO L225 Difference]: With dead ends: 872 [2024-11-19 00:33:54,815 INFO L226 Difference]: Without dead ends: 512 [2024-11-19 00:33:54,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:33:54,817 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 162 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 3475 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:54,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 3475 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:33:54,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-11-19 00:33:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 509. [2024-11-19 00:33:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 464 states have (on average 1.418103448275862) internal successors, (658), 465 states have internal predecessors, (658), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:33:54,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 738 transitions. [2024-11-19 00:33:54,837 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 738 transitions. Word has length 139 [2024-11-19 00:33:54,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:54,837 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 738 transitions. [2024-11-19 00:33:54,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-19 00:33:54,838 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 738 transitions. [2024-11-19 00:33:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 00:33:54,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:54,839 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:54,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:33:54,840 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:54,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1816788908, now seen corresponding path program 1 times [2024-11-19 00:33:54,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:54,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574018382] [2024-11-19 00:33:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:54,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:55,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:55,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574018382] [2024-11-19 00:33:55,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574018382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:55,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:55,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:33:55,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948016831] [2024-11-19 00:33:55,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:55,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:33:55,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:55,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:33:55,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:33:55,265 INFO L87 Difference]: Start difference. First operand 509 states and 738 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:55,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:55,387 INFO L93 Difference]: Finished difference Result 1059 states and 1535 transitions. [2024-11-19 00:33:55,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:33:55,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-19 00:33:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:55,390 INFO L225 Difference]: With dead ends: 1059 [2024-11-19 00:33:55,391 INFO L226 Difference]: Without dead ends: 553 [2024-11-19 00:33:55,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:33:55,393 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 158 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:55,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1035 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:33:55,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-19 00:33:55,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 507. [2024-11-19 00:33:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 462 states have (on average 1.4177489177489178) internal successors, (655), 463 states have internal predecessors, (655), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:33:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 735 transitions. [2024-11-19 00:33:55,415 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 735 transitions. Word has length 139 [2024-11-19 00:33:55,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:55,416 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 735 transitions. [2024-11-19 00:33:55,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:55,416 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 735 transitions. [2024-11-19 00:33:55,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 00:33:55,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:55,418 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:55,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:33:55,418 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:55,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:55,419 INFO L85 PathProgramCache]: Analyzing trace with hash 959465360, now seen corresponding path program 1 times [2024-11-19 00:33:55,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:55,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653014546] [2024-11-19 00:33:55,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:55,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:55,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:55,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653014546] [2024-11-19 00:33:55,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653014546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:55,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:55,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:33:55,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548257337] [2024-11-19 00:33:55,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:55,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:33:55,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:55,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:33:55,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:33:55,853 INFO L87 Difference]: Start difference. First operand 507 states and 735 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:33:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:56,020 INFO L93 Difference]: Finished difference Result 1018 states and 1472 transitions. [2024-11-19 00:33:56,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:33:56,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-11-19 00:33:56,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:56,024 INFO L225 Difference]: With dead ends: 1018 [2024-11-19 00:33:56,024 INFO L226 Difference]: Without dead ends: 514 [2024-11-19 00:33:56,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:33:56,026 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 157 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:56,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1548 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:33:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-19 00:33:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 430. [2024-11-19 00:33:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 393 states have (on average 1.4122137404580153) internal successors, (555), 393 states have internal predecessors, (555), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:33:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 619 transitions. [2024-11-19 00:33:56,051 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 619 transitions. Word has length 139 [2024-11-19 00:33:56,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:56,052 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 619 transitions. [2024-11-19 00:33:56,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:33:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 619 transitions. [2024-11-19 00:33:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 00:33:56,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:56,054 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:56,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:33:56,054 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:56,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:56,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1660529938, now seen corresponding path program 1 times [2024-11-19 00:33:56,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:56,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693941871] [2024-11-19 00:33:56,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:57,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:57,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693941871] [2024-11-19 00:33:57,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693941871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:57,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:57,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:33:57,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782420220] [2024-11-19 00:33:57,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:57,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:33:57,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:57,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:33:57,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:33:57,154 INFO L87 Difference]: Start difference. First operand 430 states and 619 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:33:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:57,564 INFO L93 Difference]: Finished difference Result 943 states and 1358 transitions. [2024-11-19 00:33:57,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:33:57,564 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-11-19 00:33:57,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:57,567 INFO L225 Difference]: With dead ends: 943 [2024-11-19 00:33:57,567 INFO L226 Difference]: Without dead ends: 516 [2024-11-19 00:33:57,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:33:57,570 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 160 mSDsluCounter, 2883 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 3250 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:57,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 3250 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:33:57,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-19 00:33:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 428. [2024-11-19 00:33:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 391 states have (on average 1.4143222506393862) internal successors, (553), 391 states have internal predecessors, (553), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:33:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 617 transitions. [2024-11-19 00:33:57,597 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 617 transitions. Word has length 139 [2024-11-19 00:33:57,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:57,597 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 617 transitions. [2024-11-19 00:33:57,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:33:57,598 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 617 transitions. [2024-11-19 00:33:57,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 00:33:57,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:57,600 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:57,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:33:57,601 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:57,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash 27483893, now seen corresponding path program 1 times [2024-11-19 00:33:57,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:57,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092633745] [2024-11-19 00:33:57,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:57,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:57,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:57,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092633745] [2024-11-19 00:33:57,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092633745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:57,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:57,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:33:57,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068685818] [2024-11-19 00:33:57,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:57,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:33:57,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:57,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:33:57,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:33:57,681 INFO L87 Difference]: Start difference. First operand 428 states and 617 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:57,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:57,717 INFO L93 Difference]: Finished difference Result 924 states and 1325 transitions. [2024-11-19 00:33:57,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:33:57,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-19 00:33:57,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:57,720 INFO L225 Difference]: With dead ends: 924 [2024-11-19 00:33:57,721 INFO L226 Difference]: Without dead ends: 499 [2024-11-19 00:33:57,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:33:57,723 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 103 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:57,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 507 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:33:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-19 00:33:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 405. [2024-11-19 00:33:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 368 states have (on average 1.391304347826087) internal successors, (512), 368 states have internal predecessors, (512), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:33:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 576 transitions. [2024-11-19 00:33:57,745 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 576 transitions. Word has length 139 [2024-11-19 00:33:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:57,746 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 576 transitions. [2024-11-19 00:33:57,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:33:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 576 transitions. [2024-11-19 00:33:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 00:33:57,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:57,748 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:57,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 00:33:57,748 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:57,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:57,749 INFO L85 PathProgramCache]: Analyzing trace with hash 994338110, now seen corresponding path program 1 times [2024-11-19 00:33:57,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:57,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097836842] [2024-11-19 00:33:57,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:57,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:58,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:58,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097836842] [2024-11-19 00:33:58,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097836842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:58,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:58,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:33:58,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164197077] [2024-11-19 00:33:58,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:58,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:33:58,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:58,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:33:58,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:33:58,691 INFO L87 Difference]: Start difference. First operand 405 states and 576 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:33:59,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:59,008 INFO L93 Difference]: Finished difference Result 1063 states and 1514 transitions. [2024-11-19 00:33:59,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 00:33:59,008 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2024-11-19 00:33:59,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:59,012 INFO L225 Difference]: With dead ends: 1063 [2024-11-19 00:33:59,012 INFO L226 Difference]: Without dead ends: 661 [2024-11-19 00:33:59,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:33:59,014 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 286 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:59,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1628 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:33:59,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-19 00:33:59,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 466. [2024-11-19 00:33:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 429 states have (on average 1.400932400932401) internal successors, (601), 429 states have internal predecessors, (601), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:33:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 665 transitions. [2024-11-19 00:33:59,044 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 665 transitions. Word has length 140 [2024-11-19 00:33:59,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:59,045 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 665 transitions. [2024-11-19 00:33:59,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:33:59,045 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 665 transitions. [2024-11-19 00:33:59,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 00:33:59,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:59,048 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:59,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 00:33:59,048 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:59,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:59,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1828991464, now seen corresponding path program 1 times [2024-11-19 00:33:59,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:59,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681591315] [2024-11-19 00:33:59,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:59,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:33:59,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:59,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681591315] [2024-11-19 00:33:59,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681591315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:59,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:59,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:33:59,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277909168] [2024-11-19 00:33:59,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:59,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:33:59,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:59,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:33:59,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:33:59,558 INFO L87 Difference]: Start difference. First operand 466 states and 665 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-19 00:33:59,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:59,825 INFO L93 Difference]: Finished difference Result 1276 states and 1826 transitions. [2024-11-19 00:33:59,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:33:59,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 140 [2024-11-19 00:33:59,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:59,830 INFO L225 Difference]: With dead ends: 1276 [2024-11-19 00:33:59,830 INFO L226 Difference]: Without dead ends: 813 [2024-11-19 00:33:59,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:33:59,831 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 166 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:59,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1358 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:33:59,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-11-19 00:33:59,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 723. [2024-11-19 00:33:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 672 states have (on average 1.40625) internal successors, (945), 673 states have internal predecessors, (945), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-19 00:33:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1033 transitions. [2024-11-19 00:33:59,859 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1033 transitions. Word has length 140 [2024-11-19 00:33:59,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:59,860 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1033 transitions. [2024-11-19 00:33:59,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-19 00:33:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1033 transitions. [2024-11-19 00:33:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-19 00:33:59,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:59,862 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:33:59,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 00:33:59,862 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:59,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:59,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1250366637, now seen corresponding path program 1 times [2024-11-19 00:33:59,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:59,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490218093] [2024-11-19 00:33:59,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:59,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 00:34:00,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:00,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490218093] [2024-11-19 00:34:00,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490218093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:34:00,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322432519] [2024-11-19 00:34:00,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:00,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:34:00,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:34:00,372 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:34:00,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 00:34:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:00,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 00:34:00,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:00,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 00:34:00,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 00:34:01,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2024-11-19 00:34:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-11-19 00:34:01,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:34:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 00:34:02,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322432519] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:34:02,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:34:02,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 14] total 26 [2024-11-19 00:34:02,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977308410] [2024-11-19 00:34:02,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:34:02,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 00:34:02,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:02,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 00:34:02,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2024-11-19 00:34:02,116 INFO L87 Difference]: Start difference. First operand 723 states and 1033 transitions. Second operand has 26 states, 23 states have (on average 7.565217391304348) internal successors, (174), 26 states have internal predecessors, (174), 8 states have call successors, (47), 3 states have call predecessors, (47), 6 states have return successors, (47), 5 states have call predecessors, (47), 8 states have call successors, (47) [2024-11-19 00:34:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:03,496 INFO L93 Difference]: Finished difference Result 2081 states and 2940 transitions. [2024-11-19 00:34:03,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-19 00:34:03,496 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.565217391304348) internal successors, (174), 26 states have internal predecessors, (174), 8 states have call successors, (47), 3 states have call predecessors, (47), 6 states have return successors, (47), 5 states have call predecessors, (47), 8 states have call successors, (47) Word has length 142 [2024-11-19 00:34:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:03,505 INFO L225 Difference]: With dead ends: 2081 [2024-11-19 00:34:03,505 INFO L226 Difference]: Without dead ends: 1361 [2024-11-19 00:34:03,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 269 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=557, Invalid=2983, Unknown=0, NotChecked=0, Total=3540 [2024-11-19 00:34:03,508 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1601 mSDsluCounter, 3018 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 3231 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:03,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 3231 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:34:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2024-11-19 00:34:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1059. [2024-11-19 00:34:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 971 states have (on average 1.3903192584963955) internal successors, (1350), 973 states have internal predecessors, (1350), 72 states have call successors, (72), 15 states have call predecessors, (72), 15 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-19 00:34:03,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1494 transitions. [2024-11-19 00:34:03,560 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1494 transitions. Word has length 142 [2024-11-19 00:34:03,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:03,561 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1494 transitions. [2024-11-19 00:34:03,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.565217391304348) internal successors, (174), 26 states have internal predecessors, (174), 8 states have call successors, (47), 3 states have call predecessors, (47), 6 states have return successors, (47), 5 states have call predecessors, (47), 8 states have call successors, (47) [2024-11-19 00:34:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1494 transitions. [2024-11-19 00:34:03,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-19 00:34:03,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:03,564 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:03,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 00:34:03,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:34:03,769 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:03,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:03,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1777556604, now seen corresponding path program 1 times [2024-11-19 00:34:03,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:03,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242684077] [2024-11-19 00:34:03,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:03,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:34:03,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:03,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242684077] [2024-11-19 00:34:03,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242684077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:03,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:03,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:34:03,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348974111] [2024-11-19 00:34:03,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:03,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:34:03,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:03,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:34:03,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:34:03,955 INFO L87 Difference]: Start difference. First operand 1059 states and 1494 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:04,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:04,080 INFO L93 Difference]: Finished difference Result 2737 states and 3862 transitions. [2024-11-19 00:34:04,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:34:04,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 142 [2024-11-19 00:34:04,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:04,088 INFO L225 Difference]: With dead ends: 2737 [2024-11-19 00:34:04,089 INFO L226 Difference]: Without dead ends: 1681 [2024-11-19 00:34:04,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:34:04,091 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 198 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:04,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 795 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:34:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2024-11-19 00:34:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1065. [2024-11-19 00:34:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 977 states have (on average 1.3879222108495395) internal successors, (1356), 979 states have internal predecessors, (1356), 72 states have call successors, (72), 15 states have call predecessors, (72), 15 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-19 00:34:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1500 transitions. [2024-11-19 00:34:04,148 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1500 transitions. Word has length 142 [2024-11-19 00:34:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:04,148 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1500 transitions. [2024-11-19 00:34:04,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1500 transitions. [2024-11-19 00:34:04,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-19 00:34:04,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:04,150 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:04,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 00:34:04,150 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:04,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:04,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1911570110, now seen corresponding path program 1 times [2024-11-19 00:34:04,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:04,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643275981] [2024-11-19 00:34:04,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:04,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:34:04,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:04,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643275981] [2024-11-19 00:34:04,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643275981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:04,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:04,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:34:04,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747519123] [2024-11-19 00:34:04,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:04,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:34:04,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:04,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:34:04,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:34:04,738 INFO L87 Difference]: Start difference. First operand 1065 states and 1500 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:34:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:04,963 INFO L93 Difference]: Finished difference Result 2257 states and 3178 transitions. [2024-11-19 00:34:04,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:34:04,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2024-11-19 00:34:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:04,969 INFO L225 Difference]: With dead ends: 2257 [2024-11-19 00:34:04,970 INFO L226 Difference]: Without dead ends: 1195 [2024-11-19 00:34:04,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:34:04,972 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 192 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:04,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1447 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:34:04,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2024-11-19 00:34:05,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1144. [2024-11-19 00:34:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1046 states have (on average 1.387189292543021) internal successors, (1451), 1049 states have internal predecessors, (1451), 80 states have call successors, (80), 17 states have call predecessors, (80), 17 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-19 00:34:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1611 transitions. [2024-11-19 00:34:05,028 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1611 transitions. Word has length 142 [2024-11-19 00:34:05,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:05,028 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1611 transitions. [2024-11-19 00:34:05,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:34:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1611 transitions. [2024-11-19 00:34:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-19 00:34:05,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:05,030 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:05,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 00:34:05,031 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:05,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:05,031 INFO L85 PathProgramCache]: Analyzing trace with hash -347112638, now seen corresponding path program 1 times [2024-11-19 00:34:05,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:05,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281173910] [2024-11-19 00:34:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:05,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:34:05,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:05,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281173910] [2024-11-19 00:34:05,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281173910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:05,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:05,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:34:05,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033335175] [2024-11-19 00:34:05,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:05,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:34:05,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:05,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:34:05,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:34:05,447 INFO L87 Difference]: Start difference. First operand 1144 states and 1611 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:34:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:05,654 INFO L93 Difference]: Finished difference Result 2285 states and 3210 transitions. [2024-11-19 00:34:05,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:34:05,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2024-11-19 00:34:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:05,660 INFO L225 Difference]: With dead ends: 2285 [2024-11-19 00:34:05,660 INFO L226 Difference]: Without dead ends: 1144 [2024-11-19 00:34:05,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:34:05,664 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 153 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:05,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 859 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:34:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-11-19 00:34:05,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 971. [2024-11-19 00:34:05,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 896 states have (on average 1.3828125) internal successors, (1239), 897 states have internal predecessors, (1239), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-19 00:34:05,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1359 transitions. [2024-11-19 00:34:05,708 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1359 transitions. Word has length 143 [2024-11-19 00:34:05,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:05,708 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1359 transitions. [2024-11-19 00:34:05,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:34:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1359 transitions. [2024-11-19 00:34:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-19 00:34:05,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:05,710 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:05,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 00:34:05,711 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:05,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:05,711 INFO L85 PathProgramCache]: Analyzing trace with hash 487540716, now seen corresponding path program 1 times [2024-11-19 00:34:05,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:05,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248211985] [2024-11-19 00:34:05,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:05,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:34:05,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:34:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:34:05,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:34:05,892 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:34:05,893 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:34:05,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 00:34:05,898 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:05,993 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:34:05,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:34:05 BoogieIcfgContainer [2024-11-19 00:34:05,997 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:34:05,998 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:34:05,998 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:34:05,998 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:34:06,000 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:33:44" (3/4) ... [2024-11-19 00:34:06,003 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:34:06,004 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:34:06,005 INFO L158 Benchmark]: Toolchain (without parser) took 22571.37ms. Allocated memory was 159.4MB in the beginning and 627.0MB in the end (delta: 467.7MB). Free memory was 129.3MB in the beginning and 235.4MB in the end (delta: -106.0MB). Peak memory consumption was 363.4MB. Max. memory is 16.1GB. [2024-11-19 00:34:06,005 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:34:06,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.66ms. Allocated memory is still 159.4MB. Free memory was 129.3MB in the beginning and 112.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 00:34:06,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.88ms. Allocated memory is still 159.4MB. Free memory was 112.2MB in the beginning and 107.5MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 00:34:06,009 INFO L158 Benchmark]: Boogie Preprocessor took 103.88ms. Allocated memory is still 159.4MB. Free memory was 107.5MB in the beginning and 101.8MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:34:06,009 INFO L158 Benchmark]: RCFGBuilder took 924.53ms. Allocated memory is still 159.4MB. Free memory was 101.8MB in the beginning and 125.6MB in the end (delta: -23.8MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2024-11-19 00:34:06,009 INFO L158 Benchmark]: TraceAbstraction took 21098.66ms. Allocated memory was 159.4MB in the beginning and 627.0MB in the end (delta: 467.7MB). Free memory was 124.8MB in the beginning and 235.4MB in the end (delta: -110.6MB). Peak memory consumption was 356.9MB. Max. memory is 16.1GB. [2024-11-19 00:34:06,010 INFO L158 Benchmark]: Witness Printer took 6.56ms. Allocated memory is still 627.0MB. Free memory is still 235.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:34:06,011 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.66ms. Allocated memory is still 159.4MB. Free memory was 129.3MB in the beginning and 112.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.88ms. Allocated memory is still 159.4MB. Free memory was 112.2MB in the beginning and 107.5MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.88ms. Allocated memory is still 159.4MB. Free memory was 107.5MB in the beginning and 101.8MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 924.53ms. Allocated memory is still 159.4MB. Free memory was 101.8MB in the beginning and 125.6MB in the end (delta: -23.8MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21098.66ms. Allocated memory was 159.4MB in the beginning and 627.0MB in the end (delta: 467.7MB). Free memory was 124.8MB in the beginning and 235.4MB in the end (delta: -110.6MB). Peak memory consumption was 356.9MB. Max. memory is 16.1GB. * Witness Printer took 6.56ms. Allocated memory is still 627.0MB. Free memory is still 235.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someUnaryDOUBLEoperation at line 26. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 0} }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L31] unsigned char last_1_BOOL_unsigned_char_Array_0_0__0_ = 1; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L90] EXPR BOOL_unsigned_char_Array_0[0][0] [L90] last_1_BOOL_unsigned_char_Array_0_0__0_ = BOOL_unsigned_char_Array_0[0][0] [L100] RET updateLastVariables() [L101] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L64] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L65] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L68] double_Array_0[1] = __VERIFIER_nondet_double() [L69] EXPR double_Array_0[1] [L69] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L69] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L69] EXPR double_Array_0[1] [L69] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L69] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L69] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L69] CALL assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L69] RET assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L70] double_Array_0[2] = __VERIFIER_nondet_double() [L71] EXPR double_Array_0[2] [L71] EXPR double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L71] EXPR double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F [L71] EXPR double_Array_0[2] [L71] EXPR double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L71] EXPR (double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L71] EXPR (double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L71] CALL assume_abort_if_not((double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L71] RET assume_abort_if_not((double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L72] double_Array_0[3] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[3] [L73] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L73] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F [L73] EXPR double_Array_0[3] [L73] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L73] EXPR (double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L73] EXPR (double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L73] CALL assume_abort_if_not((double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L73] RET assume_abort_if_not((double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L74] double_Array_0[4] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[4] [L75] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L75] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F [L75] EXPR double_Array_0[4] [L75] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L75] EXPR (double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L75] EXPR (double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L75] CALL assume_abort_if_not((double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L75] RET assume_abort_if_not((double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L76] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L77] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L77] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -536870912) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L77] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -536870912) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L78] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L78] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 536870912) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L78] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 536870912) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L79] signed_long_int_Array_0[1] = __VERIFIER_nondet_long() [L80] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L80] CALL assume_abort_if_not(signed_long_int_Array_0[1] >= -536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L80] RET assume_abort_if_not(signed_long_int_Array_0[1] >= -536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L81] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L81] CALL assume_abort_if_not(signed_long_int_Array_0[1] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L81] RET assume_abort_if_not(signed_long_int_Array_0[1] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L82] signed_long_int_Array_0[2] = __VERIFIER_nondet_long() [L83] EXPR signed_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L83] CALL assume_abort_if_not(signed_long_int_Array_0[2] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L83] RET assume_abort_if_not(signed_long_int_Array_0[2] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L84] EXPR signed_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L84] CALL assume_abort_if_not(signed_long_int_Array_0[2] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L84] RET assume_abort_if_not(signed_long_int_Array_0[2] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L85] signed_long_int_Array_0[3] = __VERIFIER_nondet_long() [L86] EXPR signed_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L86] CALL assume_abort_if_not(signed_long_int_Array_0[3] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L86] RET assume_abort_if_not(signed_long_int_Array_0[3] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L87] EXPR signed_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[3] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L87] RET assume_abort_if_not(signed_long_int_Array_0[3] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L101] RET updateVariables() [L102] CALL step() [L35] unsigned char stepLocal_0 = last_1_BOOL_unsigned_char_Array_0_0__0_; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}, stepLocal_0=1] [L36] COND FALSE !(! last_1_BOOL_unsigned_char_Array_0_0__0_) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L41] EXPR signed_long_int_Array_0[3] [L41] signed long int stepLocal_2 = signed_long_int_Array_0[3]; [L42] EXPR signed_long_int_Array_0[1] [L42] signed long int stepLocal_1 = signed_long_int_Array_0[1]; [L43] EXPR signed_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L43] COND FALSE !(signed_long_int_Array_0[2] <= stepLocal_2) [L50] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L50] COND FALSE !(! BOOL_unsigned_char_Array_0[0][0]) [L53] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L53] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L53] EXPR signed_long_int_Array_0[0] [L53] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}, stepLocal_0=1, stepLocal_1=536870911] [L53] EXPR signed_long_int_Array_0[1] [L53] EXPR signed_long_int_Array_0[3] [L53] signed_long_int_Array_0[4] = ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]) [L55] BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L55] COND FALSE !(BOOL_unsigned_char_Array_0[0][1]) [L58] EXPR double_Array_0[4] [L58] double_Array_0[0] = double_Array_0[4] [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR (! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1 [L93] EXPR (! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3])))) [L93] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR (! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))) [L93] EXPR signed_long_int_Array_0[4] [L93] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L93] EXPR signed_long_int_Array_0[0] [L93] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR signed_long_int_Array_0[1] [L93] EXPR signed_long_int_Array_0[3] [L93] EXPR (! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR (((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR (((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1) [L93] EXPR signed_long_int_Array_0[2] [L93] EXPR signed_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR (signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1 [L93] EXPR (signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR (((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1)) && (BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1)) && (BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4]))) [L93] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4])) [L93] EXPR double_Array_0[0] [L93] EXPR double_Array_0[4] [L93] EXPR BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1)) && (BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93-L94] return ((((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1)) && (BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4]))) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 149 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.9s, OverallIterations: 23, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4738 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4727 mSDsluCounter, 28241 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22440 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4030 IncrementalHoareTripleChecker+Invalid, 4150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 5801 mSDtfsCounter, 4030 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1084 GetRequests, 896 SyntacticMatches, 2 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1144occurred in iteration=21, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 2002 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 3863 NumberOfCodeBlocks, 3863 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3834 ConstructedInterpolants, 0 QuantifiedInterpolants, 10144 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2212 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 13149/13440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 00:34:06,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5c5409edee222b3f26bc580399bcb562d4fe1c01c7706a6bada265380f08e33c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:34:08,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:34:08,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:34:08,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:34:08,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:34:08,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:34:08,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:34:08,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:34:08,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:34:08,447 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:34:08,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:34:08,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:34:08,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:34:08,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:34:08,450 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:34:08,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:34:08,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:34:08,451 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:34:08,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:34:08,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:34:08,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:34:08,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:34:08,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:34:08,456 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:34:08,457 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:34:08,457 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:34:08,457 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:34:08,457 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:34:08,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:34:08,458 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:34:08,458 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:34:08,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:34:08,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:34:08,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:34:08,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:34:08,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:34:08,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:34:08,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:34:08,461 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:34:08,461 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:34:08,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:34:08,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:34:08,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:34:08,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:34:08,462 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5c5409edee222b3f26bc580399bcb562d4fe1c01c7706a6bada265380f08e33c [2024-11-19 00:34:08,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:34:08,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:34:08,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:34:08,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:34:08,829 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:34:08,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i [2024-11-19 00:34:10,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:34:10,634 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:34:10,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i [2024-11-19 00:34:10,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a0756c3a/588a25cf06f14fd58bcee3797a33cf19/FLAG9548cdc57 [2024-11-19 00:34:10,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a0756c3a/588a25cf06f14fd58bcee3797a33cf19 [2024-11-19 00:34:10,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:34:10,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:34:10,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:34:10,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:34:10,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:34:11,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:34:10" (1/1) ... [2024-11-19 00:34:11,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c395e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:11, skipping insertion in model container [2024-11-19 00:34:11,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:34:10" (1/1) ... [2024-11-19 00:34:11,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:34:11,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i[915,928] [2024-11-19 00:34:11,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:34:11,310 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:34:11,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i[915,928] [2024-11-19 00:34:11,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:34:11,412 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:34:11,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:11 WrapperNode [2024-11-19 00:34:11,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:34:11,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:34:11,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:34:11,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:34:11,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:11" (1/1) ... [2024-11-19 00:34:11,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:11" (1/1) ... [2024-11-19 00:34:11,487 INFO L138 Inliner]: procedures = 33, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 625 [2024-11-19 00:34:11,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:34:11,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:34:11,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:34:11,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:34:11,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:11" (1/1) ... [2024-11-19 00:34:11,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:11" (1/1) ... [2024-11-19 00:34:11,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:11" (1/1) ... [2024-11-19 00:34:11,557 INFO L175 MemorySlicer]: Split 151 memory accesses to 4 slices as follows [2, 31, 75, 43]. 50 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 5, 5]. The 17 writes are split as follows [0, 5, 6, 6]. [2024-11-19 00:34:11,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:11" (1/1) ... [2024-11-19 00:34:11,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:11" (1/1) ... [2024-11-19 00:34:11,598 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:11" (1/1) ... [2024-11-19 00:34:11,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:11" (1/1) ... [2024-11-19 00:34:11,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:11" (1/1) ... [2024-11-19 00:34:11,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:11" (1/1) ... [2024-11-19 00:34:11,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:34:11,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:34:11,634 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:34:11,634 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:34:11,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:11" (1/1) ... [2024-11-19 00:34:11,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:34:11,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:34:11,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:34:11,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:34:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:34:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 00:34:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 00:34:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-19 00:34:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-19 00:34:11,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 00:34:11,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 00:34:11,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 00:34:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-19 00:34:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:34:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:34:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:34:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:34:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:34:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:34:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:34:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:34:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:34:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:34:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:34:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:34:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 00:34:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 00:34:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-19 00:34:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-19 00:34:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:34:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:34:11,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:34:11,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:34:11,749 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:34:11,749 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:34:11,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:34:11,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:34:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:34:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:34:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:34:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:34:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:34:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:34:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:34:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:34:11,924 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:34:11,927 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:34:13,533 INFO L? ?]: Removed 192 outVars from TransFormulas that were not future-live. [2024-11-19 00:34:13,533 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:34:13,552 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:34:13,553 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:34:13,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:34:13 BoogieIcfgContainer [2024-11-19 00:34:13,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:34:13,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:34:13,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:34:13,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:34:13,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:34:10" (1/3) ... [2024-11-19 00:34:13,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39708532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:34:13, skipping insertion in model container [2024-11-19 00:34:13,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:11" (2/3) ... [2024-11-19 00:34:13,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39708532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:34:13, skipping insertion in model container [2024-11-19 00:34:13,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:34:13" (3/3) ... [2024-11-19 00:34:13,563 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-3.i [2024-11-19 00:34:13,579 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:34:13,579 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:34:13,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:34:13,653 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;@3e26ed68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:34:13,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:34:13,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:34:13,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 00:34:13,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:13,679 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:13,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:13,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:13,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1274553811, now seen corresponding path program 1 times [2024-11-19 00:34:13,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:13,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155404427] [2024-11-19 00:34:13,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:13,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:13,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:13,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:13,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 00:34:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:14,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:34:14,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-11-19 00:34:14,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:14,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:14,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155404427] [2024-11-19 00:34:14,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155404427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:14,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:14,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:34:14,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692943976] [2024-11-19 00:34:14,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:14,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:34:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:14,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:34:14,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:34:14,150 INFO L87 Difference]: Start difference. First operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:34:14,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:14,182 INFO L93 Difference]: Finished difference Result 291 states and 454 transitions. [2024-11-19 00:34:14,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:34:14,185 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-19 00:34:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:14,195 INFO L225 Difference]: With dead ends: 291 [2024-11-19 00:34:14,196 INFO L226 Difference]: Without dead ends: 145 [2024-11-19 00:34:14,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:34:14,205 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:14,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:34:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-19 00:34:14,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-19 00:34:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4409448818897639) internal successors, (183), 127 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:34:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2024-11-19 00:34:14,266 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 133 [2024-11-19 00:34:14,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:14,267 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2024-11-19 00:34:14,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:34:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2024-11-19 00:34:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 00:34:14,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:14,272 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:14,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 00:34:14,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:14,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:14,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:14,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1186476437, now seen corresponding path program 1 times [2024-11-19 00:34:14,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:14,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191122826] [2024-11-19 00:34:14,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:14,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:14,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:14,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:14,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 00:34:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:14,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:34:14,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-19 00:34:14,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:14,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:14,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191122826] [2024-11-19 00:34:14,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191122826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:14,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:14,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:34:14,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521046445] [2024-11-19 00:34:14,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:14,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:34:14,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:14,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:34:14,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:34:14,847 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:34:14,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:14,963 INFO L93 Difference]: Finished difference Result 289 states and 430 transitions. [2024-11-19 00:34:14,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:34:14,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-19 00:34:14,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:14,965 INFO L225 Difference]: With dead ends: 289 [2024-11-19 00:34:14,965 INFO L226 Difference]: Without dead ends: 147 [2024-11-19 00:34:14,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:34:14,967 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:14,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:34:14,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-19 00:34:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-19 00:34:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:34:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2024-11-19 00:34:14,979 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 133 [2024-11-19 00:34:14,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:14,981 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2024-11-19 00:34:14,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:34:14,981 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2024-11-19 00:34:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 00:34:14,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:14,984 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:14,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 00:34:15,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:15,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:15,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:15,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1149916073, now seen corresponding path program 1 times [2024-11-19 00:34:15,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:15,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945597449] [2024-11-19 00:34:15,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:15,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:15,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:15,189 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:15,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 00:34:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:15,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:34:15,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:34:15,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:15,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:15,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945597449] [2024-11-19 00:34:15,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945597449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:15,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:15,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:34:15,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329072812] [2024-11-19 00:34:15,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:15,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:34:15,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:15,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:34:15,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:34:15,492 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:15,537 INFO L93 Difference]: Finished difference Result 293 states and 434 transitions. [2024-11-19 00:34:15,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:34:15,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-19 00:34:15,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:15,544 INFO L225 Difference]: With dead ends: 293 [2024-11-19 00:34:15,544 INFO L226 Difference]: Without dead ends: 149 [2024-11-19 00:34:15,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:34:15,550 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:15,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:34:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-19 00:34:15,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-19 00:34:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.4274809160305344) internal successors, (187), 131 states have internal predecessors, (187), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:34:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 219 transitions. [2024-11-19 00:34:15,569 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 219 transitions. Word has length 133 [2024-11-19 00:34:15,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:15,585 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 219 transitions. [2024-11-19 00:34:15,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 219 transitions. [2024-11-19 00:34:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 00:34:15,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:15,588 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:15,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 00:34:15,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:15,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:15,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash -634850903, now seen corresponding path program 1 times [2024-11-19 00:34:15,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:15,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623209182] [2024-11-19 00:34:15,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:15,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:15,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:15,794 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:15,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 00:34:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:16,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:34:16,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:16,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 00:34:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:34:16,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:16,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:16,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623209182] [2024-11-19 00:34:16,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623209182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:16,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:16,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:34:16,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717793812] [2024-11-19 00:34:16,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:16,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:34:16,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:16,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:34:16,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:34:16,385 INFO L87 Difference]: Start difference. First operand 149 states and 219 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:16,594 INFO L93 Difference]: Finished difference Result 503 states and 742 transitions. [2024-11-19 00:34:16,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:34:16,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-19 00:34:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:16,597 INFO L225 Difference]: With dead ends: 503 [2024-11-19 00:34:16,598 INFO L226 Difference]: Without dead ends: 357 [2024-11-19 00:34:16,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:34:16,601 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 386 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:16,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 588 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:34:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-19 00:34:16,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 311. [2024-11-19 00:34:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 276 states have (on average 1.431159420289855) internal successors, (395), 276 states have internal predecessors, (395), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:34:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 459 transitions. [2024-11-19 00:34:16,642 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 459 transitions. Word has length 135 [2024-11-19 00:34:16,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:16,643 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 459 transitions. [2024-11-19 00:34:16,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:16,643 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 459 transitions. [2024-11-19 00:34:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 00:34:16,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:16,645 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:16,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 00:34:16,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:16,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:16,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:16,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1812732430, now seen corresponding path program 1 times [2024-11-19 00:34:16,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:16,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766080178] [2024-11-19 00:34:16,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:16,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:16,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:16,854 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:16,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 00:34:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:17,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:34:17,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:17,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-19 00:34:17,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:17,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2024-11-19 00:34:18,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:18,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 17 [2024-11-19 00:34:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-11-19 00:34:18,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:18,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:18,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766080178] [2024-11-19 00:34:18,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766080178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:18,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:18,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:34:18,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008485407] [2024-11-19 00:34:18,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:18,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:34:18,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:18,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:34:18,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:34:18,620 INFO L87 Difference]: Start difference. First operand 311 states and 459 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:34:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:18,828 INFO L93 Difference]: Finished difference Result 621 states and 916 transitions. [2024-11-19 00:34:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:34:18,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2024-11-19 00:34:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:18,833 INFO L225 Difference]: With dead ends: 621 [2024-11-19 00:34:18,833 INFO L226 Difference]: Without dead ends: 313 [2024-11-19 00:34:18,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:34:18,837 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 263 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:18,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 968 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:34:18,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-19 00:34:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2024-11-19 00:34:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 276 states have (on average 1.4275362318840579) internal successors, (394), 276 states have internal predecessors, (394), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:34:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 458 transitions. [2024-11-19 00:34:18,868 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 458 transitions. Word has length 135 [2024-11-19 00:34:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:18,868 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 458 transitions. [2024-11-19 00:34:18,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:34:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 458 transitions. [2024-11-19 00:34:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 00:34:18,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:18,872 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:18,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 00:34:19,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:19,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:19,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash 872276686, now seen corresponding path program 1 times [2024-11-19 00:34:19,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:19,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338405353] [2024-11-19 00:34:19,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:19,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:19,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:19,080 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:19,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 00:34:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:19,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 00:34:19,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:19,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-19 00:34:19,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-19 00:34:20,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:20,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 55 [2024-11-19 00:34:20,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:20,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 17 [2024-11-19 00:34:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-11-19 00:34:20,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:34:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 00:34:21,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:21,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338405353] [2024-11-19 00:34:21,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338405353] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:34:21,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:34:21,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-11-19 00:34:21,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238532044] [2024-11-19 00:34:21,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:34:21,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 00:34:21,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:21,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 00:34:21,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:34:21,433 INFO L87 Difference]: Start difference. First operand 311 states and 458 transitions. Second operand has 16 states, 14 states have (on average 7.642857142857143) internal successors, (107), 15 states have internal predecessors, (107), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-19 00:34:22,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:22,987 INFO L93 Difference]: Finished difference Result 757 states and 1104 transitions. [2024-11-19 00:34:22,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 00:34:22,988 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.642857142857143) internal successors, (107), 15 states have internal predecessors, (107), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) Word has length 136 [2024-11-19 00:34:22,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:22,992 INFO L225 Difference]: With dead ends: 757 [2024-11-19 00:34:22,993 INFO L226 Difference]: Without dead ends: 588 [2024-11-19 00:34:22,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=256, Invalid=800, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 00:34:22,995 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 577 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:22,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 1639 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:34:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-19 00:34:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 491. [2024-11-19 00:34:23,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 436 states have (on average 1.4220183486238531) internal successors, (620), 436 states have internal predecessors, (620), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:34:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 716 transitions. [2024-11-19 00:34:23,028 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 716 transitions. Word has length 136 [2024-11-19 00:34:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:23,028 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 716 transitions. [2024-11-19 00:34:23,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.642857142857143) internal successors, (107), 15 states have internal predecessors, (107), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-19 00:34:23,029 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 716 transitions. [2024-11-19 00:34:23,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:34:23,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:23,030 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:23,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-19 00:34:23,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:23,232 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:23,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:23,232 INFO L85 PathProgramCache]: Analyzing trace with hash -844346088, now seen corresponding path program 1 times [2024-11-19 00:34:23,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:23,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486943846] [2024-11-19 00:34:23,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:23,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:23,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:23,236 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:23,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 00:34:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:23,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:34:23,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:23,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 00:34:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:34:23,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:23,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:23,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486943846] [2024-11-19 00:34:23,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486943846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:23,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:23,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:34:23,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890717345] [2024-11-19 00:34:23,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:23,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:34:23,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:23,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:34:23,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:34:23,611 INFO L87 Difference]: Start difference. First operand 491 states and 716 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:24,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:24,775 INFO L93 Difference]: Finished difference Result 1152 states and 1682 transitions. [2024-11-19 00:34:24,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:34:24,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-19 00:34:24,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:24,779 INFO L225 Difference]: With dead ends: 1152 [2024-11-19 00:34:24,779 INFO L226 Difference]: Without dead ends: 664 [2024-11-19 00:34:24,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:34:24,781 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 199 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:24,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 916 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 00:34:24,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-11-19 00:34:24,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 487. [2024-11-19 00:34:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 432 states have (on average 1.4166666666666667) internal successors, (612), 432 states have internal predecessors, (612), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:34:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 708 transitions. [2024-11-19 00:34:24,814 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 708 transitions. Word has length 137 [2024-11-19 00:34:24,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:24,815 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 708 transitions. [2024-11-19 00:34:24,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 708 transitions. [2024-11-19 00:34:24,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 00:34:24,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:24,817 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:24,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 00:34:25,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:25,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:25,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:25,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2072234988, now seen corresponding path program 1 times [2024-11-19 00:34:25,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:25,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96467916] [2024-11-19 00:34:25,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:25,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:25,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:25,020 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:25,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 00:34:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:25,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:34:25,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:25,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-19 00:34:25,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 00:34:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:34:25,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:25,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:25,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96467916] [2024-11-19 00:34:25,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96467916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:25,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:25,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:34:25,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110093855] [2024-11-19 00:34:25,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:25,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:34:25,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:25,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:34:25,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:34:25,333 INFO L87 Difference]: Start difference. First operand 487 states and 708 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:25,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:25,515 INFO L93 Difference]: Finished difference Result 985 states and 1434 transitions. [2024-11-19 00:34:25,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:34:25,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-19 00:34:25,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:25,521 INFO L225 Difference]: With dead ends: 985 [2024-11-19 00:34:25,521 INFO L226 Difference]: Without dead ends: 669 [2024-11-19 00:34:25,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:34:25,523 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 207 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:25,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 971 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:34:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-19 00:34:25,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 489. [2024-11-19 00:34:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 434 states have (on average 1.4147465437788018) internal successors, (614), 434 states have internal predecessors, (614), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:34:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 710 transitions. [2024-11-19 00:34:25,556 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 710 transitions. Word has length 138 [2024-11-19 00:34:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:25,557 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 710 transitions. [2024-11-19 00:34:25,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 710 transitions. [2024-11-19 00:34:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 00:34:25,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:25,559 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:25,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 00:34:25,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:25,760 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:25,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:25,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1405083858, now seen corresponding path program 1 times [2024-11-19 00:34:25,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:25,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557509915] [2024-11-19 00:34:25,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:25,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:25,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:25,763 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:25,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 00:34:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:26,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 00:34:26,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:26,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 00:34:26,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 00:34:26,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-19 00:34:26,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:26,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 14 [2024-11-19 00:34:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-11-19 00:34:26,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:34:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 00:34:26,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:26,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557509915] [2024-11-19 00:34:26,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557509915] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:34:26,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:34:26,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-19 00:34:26,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175869422] [2024-11-19 00:34:26,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:34:26,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 00:34:26,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:26,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 00:34:26,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:34:26,902 INFO L87 Difference]: Start difference. First operand 489 states and 710 transitions. Second operand has 15 states, 13 states have (on average 5.769230769230769) internal successors, (75), 15 states have internal predecessors, (75), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (31), 2 states have call predecessors, (31), 4 states have call successors, (31) [2024-11-19 00:34:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:27,619 INFO L93 Difference]: Finished difference Result 730 states and 1054 transitions. [2024-11-19 00:34:27,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 00:34:27,620 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.769230769230769) internal successors, (75), 15 states have internal predecessors, (75), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (31), 2 states have call predecessors, (31), 4 states have call successors, (31) Word has length 138 [2024-11-19 00:34:27,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:27,622 INFO L225 Difference]: With dead ends: 730 [2024-11-19 00:34:27,623 INFO L226 Difference]: Without dead ends: 413 [2024-11-19 00:34:27,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2024-11-19 00:34:27,625 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 567 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:27,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1736 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:34:27,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-19 00:34:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 319. [2024-11-19 00:34:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 282 states have (on average 1.4042553191489362) internal successors, (396), 282 states have internal predecessors, (396), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:34:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 460 transitions. [2024-11-19 00:34:27,656 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 460 transitions. Word has length 138 [2024-11-19 00:34:27,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:27,659 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 460 transitions. [2024-11-19 00:34:27,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.769230769230769) internal successors, (75), 15 states have internal predecessors, (75), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (31), 2 states have call predecessors, (31), 4 states have call successors, (31) [2024-11-19 00:34:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 460 transitions. [2024-11-19 00:34:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 00:34:27,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:27,661 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:27,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 00:34:27,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:27,862 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:27,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:27,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1777113810, now seen corresponding path program 1 times [2024-11-19 00:34:27,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:27,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62749198] [2024-11-19 00:34:27,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:27,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:27,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:27,865 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:27,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 00:34:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:28,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-19 00:34:28,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:28,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:34:28,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-19 00:34:28,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:28,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 26 [2024-11-19 00:34:28,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 [2024-11-19 00:34:29,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:29,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 57 [2024-11-19 00:34:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 332 proven. 21 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-19 00:34:30,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:34:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:34:30,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:30,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62749198] [2024-11-19 00:34:30,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62749198] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:34:30,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:34:30,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [30] total 35 [2024-11-19 00:34:30,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697652583] [2024-11-19 00:34:30,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:30,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:34:30,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:30,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:34:30,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 00:34:30,769 INFO L87 Difference]: Start difference. First operand 319 states and 460 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:31,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:31,491 INFO L93 Difference]: Finished difference Result 901 states and 1298 transitions. [2024-11-19 00:34:31,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:34:31,491 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-19 00:34:31,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:31,494 INFO L225 Difference]: With dead ends: 901 [2024-11-19 00:34:31,494 INFO L226 Difference]: Without dead ends: 585 [2024-11-19 00:34:31,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=188, Invalid=1372, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 00:34:31,496 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 164 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:31,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1927 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:34:31,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-19 00:34:31,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 581. [2024-11-19 00:34:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 524 states have (on average 1.4122137404580153) internal successors, (740), 526 states have internal predecessors, (740), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:34:31,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 836 transitions. [2024-11-19 00:34:31,532 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 836 transitions. Word has length 139 [2024-11-19 00:34:31,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:31,533 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 836 transitions. [2024-11-19 00:34:31,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:31,533 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 836 transitions. [2024-11-19 00:34:31,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 00:34:31,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:31,535 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:31,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 00:34:31,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:31,735 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:31,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:31,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1816788908, now seen corresponding path program 1 times [2024-11-19 00:34:31,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:31,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324462177] [2024-11-19 00:34:31,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:31,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:31,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:31,738 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:31,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 00:34:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:32,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:34:32,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:32,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:34:32,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-19 00:34:32,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 00:34:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:34:32,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:32,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:32,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324462177] [2024-11-19 00:34:32,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324462177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:32,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:32,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:34:32,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262643126] [2024-11-19 00:34:32,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:32,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:34:32,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:32,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:34:32,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:34:32,101 INFO L87 Difference]: Start difference. First operand 581 states and 836 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:32,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:32,283 INFO L93 Difference]: Finished difference Result 1204 states and 1730 transitions. [2024-11-19 00:34:32,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:34:32,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-19 00:34:32,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:32,289 INFO L225 Difference]: With dead ends: 1204 [2024-11-19 00:34:32,291 INFO L226 Difference]: Without dead ends: 626 [2024-11-19 00:34:32,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:34:32,293 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 159 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:32,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 895 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:34:32,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-19 00:34:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 575. [2024-11-19 00:34:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 518 states have (on average 1.4111969111969112) internal successors, (731), 520 states have internal predecessors, (731), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:34:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 827 transitions. [2024-11-19 00:34:32,329 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 827 transitions. Word has length 139 [2024-11-19 00:34:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:32,330 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 827 transitions. [2024-11-19 00:34:32,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:32,334 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 827 transitions. [2024-11-19 00:34:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 00:34:32,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:32,335 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:32,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 00:34:32,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:32,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:32,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:32,536 INFO L85 PathProgramCache]: Analyzing trace with hash 959465360, now seen corresponding path program 1 times [2024-11-19 00:34:32,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:32,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085038174] [2024-11-19 00:34:32,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:32,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:32,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:32,538 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:32,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 00:34:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:32,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:34:32,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:32,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:34:32,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-19 00:34:32,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 00:34:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:34:32,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:32,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:32,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085038174] [2024-11-19 00:34:32,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085038174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:32,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:32,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:34:32,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493949149] [2024-11-19 00:34:32,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:32,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:34:32,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:32,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:34:32,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:34:32,888 INFO L87 Difference]: Start difference. First operand 575 states and 827 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:33,091 INFO L93 Difference]: Finished difference Result 1159 states and 1660 transitions. [2024-11-19 00:34:33,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:34:33,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-19 00:34:33,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:33,095 INFO L225 Difference]: With dead ends: 1159 [2024-11-19 00:34:33,096 INFO L226 Difference]: Without dead ends: 587 [2024-11-19 00:34:33,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:34:33,097 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 157 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:33,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1124 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:34:33,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-11-19 00:34:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 421. [2024-11-19 00:34:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 382 states have (on average 1.3979057591623036) internal successors, (534), 382 states have internal predecessors, (534), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:34:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 598 transitions. [2024-11-19 00:34:33,126 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 598 transitions. Word has length 139 [2024-11-19 00:34:33,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:33,127 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 598 transitions. [2024-11-19 00:34:33,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 598 transitions. [2024-11-19 00:34:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 00:34:33,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:33,129 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:33,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 00:34:33,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:33,330 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:33,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:33,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1660529938, now seen corresponding path program 1 times [2024-11-19 00:34:33,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:33,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201533685] [2024-11-19 00:34:33,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:33,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:33,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:33,332 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:33,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 00:34:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:33,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-19 00:34:33,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:33,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:34:33,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-19 00:34:34,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:34,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 26 [2024-11-19 00:34:34,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 [2024-11-19 00:34:34,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:34,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 57 [2024-11-19 00:34:40,550 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 303 proven. 18 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-11-19 00:34:40,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:34:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:34:41,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:41,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201533685] [2024-11-19 00:34:41,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201533685] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:34:41,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:34:41,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [30] total 35 [2024-11-19 00:34:41,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417292073] [2024-11-19 00:34:41,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:41,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:34:41,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:41,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:34:41,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 00:34:41,032 INFO L87 Difference]: Start difference. First operand 421 states and 598 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:41,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:41,788 INFO L93 Difference]: Finished difference Result 1007 states and 1432 transitions. [2024-11-19 00:34:41,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:34:41,789 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-19 00:34:41,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:41,792 INFO L225 Difference]: With dead ends: 1007 [2024-11-19 00:34:41,792 INFO L226 Difference]: Without dead ends: 589 [2024-11-19 00:34:41,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=188, Invalid=1372, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 00:34:41,796 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 160 mSDsluCounter, 2241 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:41,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 2609 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:34:41,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-19 00:34:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 415. [2024-11-19 00:34:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 376 states have (on average 1.4015957446808511) internal successors, (527), 376 states have internal predecessors, (527), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:34:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 591 transitions. [2024-11-19 00:34:41,825 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 591 transitions. Word has length 139 [2024-11-19 00:34:41,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:41,825 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 591 transitions. [2024-11-19 00:34:41,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:41,825 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 591 transitions. [2024-11-19 00:34:41,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-19 00:34:41,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:41,827 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:41,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 00:34:42,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:42,028 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:42,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:42,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1334944707, now seen corresponding path program 1 times [2024-11-19 00:34:42,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:42,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434720598] [2024-11-19 00:34:42,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:42,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:42,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:42,030 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:42,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 00:34:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:42,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:34:42,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:34:42,333 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:42,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:42,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434720598] [2024-11-19 00:34:42,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434720598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:42,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:42,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:34:42,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519155817] [2024-11-19 00:34:42,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:42,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:34:42,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:42,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:34:42,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:34:42,335 INFO L87 Difference]: Start difference. First operand 415 states and 591 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:42,388 INFO L93 Difference]: Finished difference Result 833 states and 1187 transitions. [2024-11-19 00:34:42,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:34:42,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2024-11-19 00:34:42,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:42,391 INFO L225 Difference]: With dead ends: 833 [2024-11-19 00:34:42,391 INFO L226 Difference]: Without dead ends: 421 [2024-11-19 00:34:42,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:34:42,393 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 0 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:42,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 824 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:34:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-19 00:34:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-19 00:34:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 382 states have (on average 1.3952879581151831) internal successors, (533), 382 states have internal predecessors, (533), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:34:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 597 transitions. [2024-11-19 00:34:42,421 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 597 transitions. Word has length 141 [2024-11-19 00:34:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:42,422 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 597 transitions. [2024-11-19 00:34:42,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:34:42,422 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 597 transitions. [2024-11-19 00:34:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-19 00:34:42,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:42,423 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:42,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-19 00:34:42,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:42,624 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:42,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:42,625 INFO L85 PathProgramCache]: Analyzing trace with hash -347112638, now seen corresponding path program 1 times [2024-11-19 00:34:42,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:42,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322173548] [2024-11-19 00:34:42,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:42,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:42,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:42,626 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:42,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 00:34:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:42,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 00:34:42,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:42,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-19 00:34:43,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:43,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 30 [2024-11-19 00:34:44,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:44,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 66 [2024-11-19 00:34:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-11-19 00:34:44,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:34:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 00:34:45,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:45,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322173548] [2024-11-19 00:34:45,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322173548] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:34:45,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:34:45,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2024-11-19 00:34:45,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464684143] [2024-11-19 00:34:45,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:34:45,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 00:34:45,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:45,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 00:34:45,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:34:45,077 INFO L87 Difference]: Start difference. First operand 421 states and 597 transitions. Second operand has 20 states, 18 states have (on average 7.5) internal successors, (135), 20 states have internal predecessors, (135), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-19 00:34:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:46,312 INFO L93 Difference]: Finished difference Result 1224 states and 1735 transitions. [2024-11-19 00:34:46,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 00:34:46,313 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.5) internal successors, (135), 20 states have internal predecessors, (135), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) Word has length 143 [2024-11-19 00:34:46,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:46,316 INFO L225 Difference]: With dead ends: 1224 [2024-11-19 00:34:46,316 INFO L226 Difference]: Without dead ends: 806 [2024-11-19 00:34:46,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=224, Invalid=832, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 00:34:46,318 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 767 mSDsluCounter, 2306 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 2478 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:46,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 2478 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:34:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-11-19 00:34:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 743. [2024-11-19 00:34:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 685 states have (on average 1.4087591240875912) internal successors, (965), 685 states have internal predecessors, (965), 48 states have call successors, (48), 9 states have call predecessors, (48), 9 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:34:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1061 transitions. [2024-11-19 00:34:46,363 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1061 transitions. Word has length 143 [2024-11-19 00:34:46,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:46,364 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1061 transitions. [2024-11-19 00:34:46,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.5) internal successors, (135), 20 states have internal predecessors, (135), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-19 00:34:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1061 transitions. [2024-11-19 00:34:46,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-19 00:34:46,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:46,366 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:34:46,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 00:34:46,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:46,567 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:46,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:46,567 INFO L85 PathProgramCache]: Analyzing trace with hash 487540716, now seen corresponding path program 1 times [2024-11-19 00:34:46,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:46,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699781242] [2024-11-19 00:34:46,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:46,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:46,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:46,569 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:46,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 00:34:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:46,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 00:34:46,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:47,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2024-11-19 00:34:48,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:48,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 106 [2024-11-19 00:34:48,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:48,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 359 treesize of output 151 [2024-11-19 00:34:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-11-19 00:34:48,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:34:49,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:49,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699781242] [2024-11-19 00:34:49,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699781242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:34:49,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1581842542] [2024-11-19 00:34:49,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:49,314 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:34:49,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:34:49,315 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:34:49,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-19 00:34:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:50,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 00:34:50,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:50,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17