./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.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 6b58d24144d549c81ae478cdbe56bd6625ad814c6ede850dce7ec3284e5d3039 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:23:18,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:23:18,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:23:18,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:23:18,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:23:18,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:23:18,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:23:18,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:23:18,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:23:18,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:23:18,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:23:18,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:23:18,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:23:18,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:23:18,143 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:23:18,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:23:18,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:23:18,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:23:18,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:23:18,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:23:18,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:23:18,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:23:18,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:23:18,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:23:18,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:23:18,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:23:18,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:23:18,146 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:23:18,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:23:18,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:23:18,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:23:18,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:23:18,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:23:18,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:23:18,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:23:18,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:23:18,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:23:18,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:23:18,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:23:18,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:23:18,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:23:18,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:23:18,153 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 -> 6b58d24144d549c81ae478cdbe56bd6625ad814c6ede850dce7ec3284e5d3039 [2024-10-14 13:23:18,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:23:18,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:23:18,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:23:18,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:23:18,402 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:23:18,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i [2024-10-14 13:23:19,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:23:19,849 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:23:19,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i [2024-10-14 13:23:19,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f9e88c1/e534f7d10e754d628fdd73c3da59159c/FLAG5161b0669 [2024-10-14 13:23:20,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f9e88c1/e534f7d10e754d628fdd73c3da59159c [2024-10-14 13:23:20,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:23:20,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:23:20,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:23:20,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:23:20,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:23:20,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:23:20" (1/1) ... [2024-10-14 13:23:20,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ce0dbf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:20, skipping insertion in model container [2024-10-14 13:23:20,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:23:20" (1/1) ... [2024-10-14 13:23:20,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:23:20,414 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i[916,929] [2024-10-14 13:23:20,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:23:20,496 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:23:20,514 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i[916,929] [2024-10-14 13:23:20,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:23:20,576 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:23:20,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:20 WrapperNode [2024-10-14 13:23:20,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:23:20,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:23:20,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:23:20,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:23:20,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:20" (1/1) ... [2024-10-14 13:23:20,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:20" (1/1) ... [2024-10-14 13:23:20,631 INFO L138 Inliner]: procedures = 29, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2024-10-14 13:23:20,632 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:23:20,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:23:20,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:23:20,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:23:20,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:20" (1/1) ... [2024-10-14 13:23:20,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:20" (1/1) ... [2024-10-14 13:23:20,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:20" (1/1) ... [2024-10-14 13:23:20,671 INFO L175 MemorySlicer]: Split 139 memory accesses to 6 slices as follows [2, 8, 40, 10, 22, 57]. 41 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 5, 1, 2, 4]. The 17 writes are split as follows [0, 1, 6, 3, 2, 5]. [2024-10-14 13:23:20,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:20" (1/1) ... [2024-10-14 13:23:20,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:20" (1/1) ... [2024-10-14 13:23:20,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:20" (1/1) ... [2024-10-14 13:23:20,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:20" (1/1) ... [2024-10-14 13:23:20,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:20" (1/1) ... [2024-10-14 13:23:20,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:20" (1/1) ... [2024-10-14 13:23:20,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:23:20,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:23:20,721 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:23:20,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:23:20,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:20" (1/1) ... [2024-10-14 13:23:20,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:23:20,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:23:20,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:23:20,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:23:20,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:23:20,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 13:23:20,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 13:23:20,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-14 13:23:20,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-14 13:23:20,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-14 13:23:20,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-14 13:23:20,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:23:20,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:23:20,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:23:20,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:23:20,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:23:20,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:23:20,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 13:23:20,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 13:23:20,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-14 13:23:20,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-14 13:23:20,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-14 13:23:20,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-14 13:23:20,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:23:20,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:23:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:23:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:23:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:23:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:23:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 13:23:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 13:23:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-14 13:23:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-14 13:23:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-14 13:23:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-14 13:23:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:23:20,818 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:23:20,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:23:20,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:23:20,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:23:20,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:23:20,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:23:20,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:23:20,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:23:20,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:23:20,966 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:23:20,968 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:23:21,353 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2024-10-14 13:23:21,353 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:23:21,376 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:23:21,377 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:23:21,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:23:21 BoogieIcfgContainer [2024-10-14 13:23:21,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:23:21,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:23:21,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:23:21,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:23:21,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:23:20" (1/3) ... [2024-10-14 13:23:21,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f815399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:23:21, skipping insertion in model container [2024-10-14 13:23:21,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:20" (2/3) ... [2024-10-14 13:23:21,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f815399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:23:21, skipping insertion in model container [2024-10-14 13:23:21,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:23:21" (3/3) ... [2024-10-14 13:23:21,385 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-30.i [2024-10-14 13:23:21,400 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:23:21,401 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:23:21,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:23:21,453 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;@4f5dbb8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:23:21,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:23:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 93 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:23:21,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:23:21,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:21,469 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:21,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:21,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:21,474 INFO L85 PathProgramCache]: Analyzing trace with hash -35125253, now seen corresponding path program 1 times [2024-10-14 13:23:21,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:23:21,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672310300] [2024-10-14 13:23:21,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:23:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:23:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:23:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:23:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:23:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:23:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:23:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:23:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:23:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:23:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:23:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:23:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:23:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:23:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:23:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:23:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:23:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 13:23:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:21,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:23:21,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672310300] [2024-10-14 13:23:21,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672310300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:21,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:21,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:23:21,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116973374] [2024-10-14 13:23:21,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:21,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:23:21,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:23:21,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:23:21,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:23:21,865 INFO L87 Difference]: Start difference. First operand has 112 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 93 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:21,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:21,967 INFO L93 Difference]: Finished difference Result 221 states and 349 transitions. [2024-10-14 13:23:21,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:23:21,972 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2024-10-14 13:23:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:21,981 INFO L225 Difference]: With dead ends: 221 [2024-10-14 13:23:21,981 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 13:23:21,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-10-14 13:23:21,988 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:21,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:23:22,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 13:23:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-14 13:23:22,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 91 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:23:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2024-10-14 13:23:22,027 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 132 [2024-10-14 13:23:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:22,029 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2024-10-14 13:23:22,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2024-10-14 13:23:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:23:22,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:22,032 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:22,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:23:22,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:22,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:22,034 INFO L85 PathProgramCache]: Analyzing trace with hash -462905519, now seen corresponding path program 1 times [2024-10-14 13:23:22,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:23:22,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389303899] [2024-10-14 13:23:22,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:22,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:23:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:23:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:23:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:23:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:23:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:23:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:23:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:23:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:23:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:23:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:23:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:23:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:23:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:23:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:23:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:23:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:23:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 13:23:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:22,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:23:22,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389303899] [2024-10-14 13:23:22,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389303899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:22,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:22,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:23:22,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866067932] [2024-10-14 13:23:22,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:22,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:23:22,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:23:22,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:23:22,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:23:22,379 INFO L87 Difference]: Start difference. First operand 110 states and 162 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:22,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:22,432 INFO L93 Difference]: Finished difference Result 221 states and 326 transitions. [2024-10-14 13:23:22,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:23:22,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2024-10-14 13:23:22,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:22,434 INFO L225 Difference]: With dead ends: 221 [2024-10-14 13:23:22,438 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 13:23:22,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-10-14 13:23:22,440 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 458 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-10-14 13:23:22,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 458 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:23:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 13:23:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-14 13:23:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:23:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2024-10-14 13:23:22,459 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 132 [2024-10-14 13:23:22,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:22,463 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2024-10-14 13:23:22,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2024-10-14 13:23:22,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:23:22,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:22,465 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:22,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:23:22,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:22,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:22,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1379570195, now seen corresponding path program 1 times [2024-10-14 13:23:22,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:23:22,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189619833] [2024-10-14 13:23:22,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:22,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:23:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:23:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:23:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:23:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:23:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:23:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:23:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:23:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:23:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:23:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:23:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:23:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:23:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:23:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:23:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:23:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:23:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 13:23:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:23,861 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:23,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:23:23,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189619833] [2024-10-14 13:23:23,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189619833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:23,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:23,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:23:23,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21861098] [2024-10-14 13:23:23,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:23,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:23:23,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:23:23,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:23:23,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:23:23,867 INFO L87 Difference]: Start difference. First operand 112 states and 164 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:24,223 INFO L93 Difference]: Finished difference Result 400 states and 582 transitions. [2024-10-14 13:23:24,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:23:24,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2024-10-14 13:23:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:24,226 INFO L225 Difference]: With dead ends: 400 [2024-10-14 13:23:24,226 INFO L226 Difference]: Without dead ends: 289 [2024-10-14 13:23:24,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:23:24,227 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 341 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:24,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 693 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:23:24,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-14 13:23:24,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 205. [2024-10-14 13:23:24,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 174 states have (on average 1.4022988505747127) internal successors, (244), 175 states have internal predecessors, (244), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:23:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 300 transitions. [2024-10-14 13:23:24,242 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 300 transitions. Word has length 132 [2024-10-14 13:23:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:24,243 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 300 transitions. [2024-10-14 13:23:24,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 300 transitions. [2024-10-14 13:23:24,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 13:23:24,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:24,245 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:24,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:23:24,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:24,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:24,245 INFO L85 PathProgramCache]: Analyzing trace with hash -446022041, now seen corresponding path program 1 times [2024-10-14 13:23:24,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:23:24,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552631140] [2024-10-14 13:23:24,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:24,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:23:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:23:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:23:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:23:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:23:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:23:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:23:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:23:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:23:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:23:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:23:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:23:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:23:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:23:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:23:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:23:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:23:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 13:23:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:24,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:23:24,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552631140] [2024-10-14 13:23:24,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552631140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:24,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:24,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:23:24,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188523758] [2024-10-14 13:23:24,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:24,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:23:24,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:23:24,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:23:24,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:23:24,609 INFO L87 Difference]: Start difference. First operand 205 states and 300 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:24,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:24,734 INFO L93 Difference]: Finished difference Result 414 states and 604 transitions. [2024-10-14 13:23:24,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:23:24,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-14 13:23:24,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:24,736 INFO L225 Difference]: With dead ends: 414 [2024-10-14 13:23:24,736 INFO L226 Difference]: Without dead ends: 210 [2024-10-14 13:23:24,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 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-10-14 13:23:24,737 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 122 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:24,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 761 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:23:24,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-14 13:23:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2024-10-14 13:23:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 176 states have (on average 1.3977272727272727) internal successors, (246), 177 states have internal predecessors, (246), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:23:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 302 transitions. [2024-10-14 13:23:24,748 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 302 transitions. Word has length 133 [2024-10-14 13:23:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:24,749 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 302 transitions. [2024-10-14 13:23:24,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 302 transitions. [2024-10-14 13:23:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 13:23:24,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:24,751 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:24,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:23:24,751 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:24,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:24,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1044508184, now seen corresponding path program 1 times [2024-10-14 13:23:24,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:23:24,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769169243] [2024-10-14 13:23:24,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:24,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:23:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:23:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:23:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:23:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:23:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:23:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:23:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:23:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:23:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:23:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:23:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:23:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:23:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:23:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:23:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:23:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:23:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 13:23:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:25,088 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:25,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:23:25,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769169243] [2024-10-14 13:23:25,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769169243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:25,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:25,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:23:25,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779597465] [2024-10-14 13:23:25,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:25,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:23:25,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:23:25,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:23:25,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:23:25,091 INFO L87 Difference]: Start difference. First operand 207 states and 302 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:25,165 INFO L93 Difference]: Finished difference Result 416 states and 605 transitions. [2024-10-14 13:23:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:23:25,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 133 [2024-10-14 13:23:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:25,169 INFO L225 Difference]: With dead ends: 416 [2024-10-14 13:23:25,170 INFO L226 Difference]: Without dead ends: 210 [2024-10-14 13:23:25,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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-10-14 13:23:25,172 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 71 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:25,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 998 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:23:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-14 13:23:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2024-10-14 13:23:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 176 states have (on average 1.3920454545454546) internal successors, (245), 177 states have internal predecessors, (245), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:23:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 301 transitions. [2024-10-14 13:23:25,194 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 301 transitions. Word has length 133 [2024-10-14 13:23:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:25,194 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 301 transitions. [2024-10-14 13:23:25,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 301 transitions. [2024-10-14 13:23:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:23:25,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:25,196 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:25,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:23:25,196 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:25,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:25,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2031270524, now seen corresponding path program 1 times [2024-10-14 13:23:25,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:23:25,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029536339] [2024-10-14 13:23:25,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:25,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:23:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:23:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:23:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:23:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:23:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:23:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:23:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:23:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:23:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:23:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:23:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:23:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:23:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:23:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:23:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:23:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:23:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 13:23:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:26,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:23:26,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029536339] [2024-10-14 13:23:26,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029536339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:26,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:26,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:23:26,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940327505] [2024-10-14 13:23:26,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:26,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:23:26,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:23:26,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:23:26,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:23:26,064 INFO L87 Difference]: Start difference. First operand 207 states and 301 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:26,383 INFO L93 Difference]: Finished difference Result 591 states and 855 transitions. [2024-10-14 13:23:26,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:23:26,384 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2024-10-14 13:23:26,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:26,386 INFO L225 Difference]: With dead ends: 591 [2024-10-14 13:23:26,387 INFO L226 Difference]: Without dead ends: 385 [2024-10-14 13:23:26,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:23:26,388 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 115 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:26,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1350 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:23:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-14 13:23:26,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 242. [2024-10-14 13:23:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 211 states have (on average 1.3886255924170616) internal successors, (293), 212 states have internal predecessors, (293), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:23:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 349 transitions. [2024-10-14 13:23:26,405 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 349 transitions. Word has length 135 [2024-10-14 13:23:26,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:26,406 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 349 transitions. [2024-10-14 13:23:26,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 349 transitions. [2024-10-14 13:23:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:23:26,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:26,407 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:26,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 13:23:26,408 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:26,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2026102947, now seen corresponding path program 1 times [2024-10-14 13:23:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:23:26,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178431306] [2024-10-14 13:23:26,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:23:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:23:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:23:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:23:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:23:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:23:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:23:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:23:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:23:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:23:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:23:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:23:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:23:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:23:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:23:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:23:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:23:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 13:23:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:26,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:23:26,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178431306] [2024-10-14 13:23:26,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178431306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:26,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:26,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:23:26,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701957604] [2024-10-14 13:23:26,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:26,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:23:26,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:23:26,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:23:26,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:23:26,564 INFO L87 Difference]: Start difference. First operand 242 states and 349 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:26,597 INFO L93 Difference]: Finished difference Result 492 states and 709 transitions. [2024-10-14 13:23:26,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:23:26,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-14 13:23:26,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:26,599 INFO L225 Difference]: With dead ends: 492 [2024-10-14 13:23:26,600 INFO L226 Difference]: Without dead ends: 251 [2024-10-14 13:23:26,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-10-14 13:23:26,602 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:26,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 615 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:23:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-14 13:23:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2024-10-14 13:23:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 216 states have (on average 1.3796296296296295) internal successors, (298), 217 states have internal predecessors, (298), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:23:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 354 transitions. [2024-10-14 13:23:26,614 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 354 transitions. Word has length 135 [2024-10-14 13:23:26,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:26,615 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 354 transitions. [2024-10-14 13:23:26,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:26,615 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 354 transitions. [2024-10-14 13:23:26,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:23:26,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:26,617 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:26,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 13:23:26,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:26,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:26,618 INFO L85 PathProgramCache]: Analyzing trace with hash -993620145, now seen corresponding path program 1 times [2024-10-14 13:23:26,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:23:26,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026263376] [2024-10-14 13:23:26,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:26,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:23:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:23:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:23:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:23:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:23:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:23:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:23:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:23:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:23:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:23:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:23:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:23:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:23:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:23:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:23:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:23:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:23:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 13:23:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:27,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:23:27,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026263376] [2024-10-14 13:23:27,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026263376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:27,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:27,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 13:23:27,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801457793] [2024-10-14 13:23:27,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:27,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 13:23:27,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:23:27,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 13:23:27,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:23:27,362 INFO L87 Difference]: Start difference. First operand 247 states and 354 transitions. Second operand has 11 states, 9 states have (on average 5.888888888888889) internal successors, (53), 11 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-14 13:23:27,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:27,906 INFO L93 Difference]: Finished difference Result 711 states and 1013 transitions. [2024-10-14 13:23:27,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 13:23:27,908 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.888888888888889) internal successors, (53), 11 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2024-10-14 13:23:27,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:27,910 INFO L225 Difference]: With dead ends: 711 [2024-10-14 13:23:27,910 INFO L226 Difference]: Without dead ends: 465 [2024-10-14 13:23:27,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-14 13:23:27,913 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 281 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:27,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1637 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:23:27,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-10-14 13:23:27,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 312. [2024-10-14 13:23:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 274 states have (on average 1.3795620437956204) internal successors, (378), 276 states have internal predecessors, (378), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 13:23:27,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 444 transitions. [2024-10-14 13:23:27,932 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 444 transitions. Word has length 135 [2024-10-14 13:23:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:27,933 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 444 transitions. [2024-10-14 13:23:27,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.888888888888889) internal successors, (53), 11 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-14 13:23:27,933 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 444 transitions. [2024-10-14 13:23:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:23:27,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:27,934 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:27,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 13:23:27,934 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:27,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:27,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2004737395, now seen corresponding path program 1 times [2024-10-14 13:23:27,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:23:27,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222954070] [2024-10-14 13:23:27,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:27,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:23:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:23:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:23:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:23:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:23:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:23:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:23:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:23:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:23:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:23:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:23:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:23:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:23:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:23:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:23:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:23:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:23:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 13:23:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:28,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:23:28,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222954070] [2024-10-14 13:23:28,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222954070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:28,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:28,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 13:23:28,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108814420] [2024-10-14 13:23:28,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:28,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 13:23:28,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:23:28,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 13:23:28,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:23:28,926 INFO L87 Difference]: Start difference. First operand 312 states and 444 transitions. Second operand has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:30,106 INFO L93 Difference]: Finished difference Result 946 states and 1340 transitions. [2024-10-14 13:23:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 13:23:30,107 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2024-10-14 13:23:30,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:30,110 INFO L225 Difference]: With dead ends: 946 [2024-10-14 13:23:30,110 INFO L226 Difference]: Without dead ends: 635 [2024-10-14 13:23:30,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-10-14 13:23:30,111 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 458 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:30,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1892 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 13:23:30,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-10-14 13:23:30,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 312. [2024-10-14 13:23:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 274 states have (on average 1.3722627737226278) internal successors, (376), 276 states have internal predecessors, (376), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 13:23:30,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 442 transitions. [2024-10-14 13:23:30,131 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 442 transitions. Word has length 135 [2024-10-14 13:23:30,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:30,131 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 442 transitions. [2024-10-14 13:23:30,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 442 transitions. [2024-10-14 13:23:30,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-14 13:23:30,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:30,133 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:30,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 13:23:30,133 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:30,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:30,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2036793778, now seen corresponding path program 1 times [2024-10-14 13:23:30,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:23:30,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383069781] [2024-10-14 13:23:30,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:30,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:23:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:23:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:23:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:23:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:23:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:23:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:23:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:23:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:23:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:23:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:23:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:23:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:23:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:23:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:23:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:23:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:23:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 13:23:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:30,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:23:30,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383069781] [2024-10-14 13:23:30,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383069781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:30,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:30,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:23:30,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82776528] [2024-10-14 13:23:30,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:30,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:23:30,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:23:30,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:23:30,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:23:30,606 INFO L87 Difference]: Start difference. First operand 312 states and 442 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:31,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:31,007 INFO L93 Difference]: Finished difference Result 657 states and 926 transitions. [2024-10-14 13:23:31,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:23:31,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-10-14 13:23:31,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:31,009 INFO L225 Difference]: With dead ends: 657 [2024-10-14 13:23:31,009 INFO L226 Difference]: Without dead ends: 346 [2024-10-14 13:23:31,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:23:31,011 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 140 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:31,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 878 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:23:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-14 13:23:31,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 265. [2024-10-14 13:23:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 232 states have (on average 1.3577586206896552) internal successors, (315), 233 states have internal predecessors, (315), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:23:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 371 transitions. [2024-10-14 13:23:31,031 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 371 transitions. Word has length 137 [2024-10-14 13:23:31,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:31,031 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 371 transitions. [2024-10-14 13:23:31,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:31,032 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 371 transitions. [2024-10-14 13:23:31,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-14 13:23:31,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:31,033 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:31,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 13:23:31,034 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:31,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:31,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2010031647, now seen corresponding path program 1 times [2024-10-14 13:23:31,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:23:31,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602799298] [2024-10-14 13:23:31,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:31,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:23:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:23:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:23:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:23:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:23:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:23:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:23:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:23:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:23:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:23:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:23:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:23:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:23:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:23:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:23:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:23:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:23:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 13:23:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:23:31,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602799298] [2024-10-14 13:23:31,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602799298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:31,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:31,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:23:31,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952115432] [2024-10-14 13:23:31,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:31,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:23:31,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:23:31,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:23:31,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:23:31,414 INFO L87 Difference]: Start difference. First operand 265 states and 371 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:31,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:31,696 INFO L93 Difference]: Finished difference Result 722 states and 1008 transitions. [2024-10-14 13:23:31,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:23:31,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-10-14 13:23:31,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:31,699 INFO L225 Difference]: With dead ends: 722 [2024-10-14 13:23:31,699 INFO L226 Difference]: Without dead ends: 458 [2024-10-14 13:23:31,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:23:31,700 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 120 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:31,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1414 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:23:31,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-14 13:23:31,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 455. [2024-10-14 13:23:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 394 states have (on average 1.3451776649746192) internal successors, (530), 397 states have internal predecessors, (530), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 13:23:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 634 transitions. [2024-10-14 13:23:31,748 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 634 transitions. Word has length 137 [2024-10-14 13:23:31,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:31,749 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 634 transitions. [2024-10-14 13:23:31,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 634 transitions. [2024-10-14 13:23:31,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 13:23:31,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:31,750 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:31,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 13:23:31,751 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:31,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:31,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1832970257, now seen corresponding path program 1 times [2024-10-14 13:23:31,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:23:31,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153555643] [2024-10-14 13:23:31,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:31,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:23:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:23:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:23:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:23:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:23:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:23:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:23:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:23:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:23:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:23:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:23:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:23:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:23:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:23:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:23:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:23:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:23:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 13:23:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:31,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:23:31,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153555643] [2024-10-14 13:23:31,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153555643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:31,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:31,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:23:31,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694779585] [2024-10-14 13:23:31,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:31,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:23:31,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:23:31,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:23:31,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:23:31,976 INFO L87 Difference]: Start difference. First operand 455 states and 634 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:32,038 INFO L93 Difference]: Finished difference Result 910 states and 1265 transitions. [2024-10-14 13:23:32,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:23:32,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-10-14 13:23:32,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:32,040 INFO L225 Difference]: With dead ends: 910 [2024-10-14 13:23:32,040 INFO L226 Difference]: Without dead ends: 456 [2024-10-14 13:23:32,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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-10-14 13:23:32,041 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 130 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:32,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 603 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:23:32,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-14 13:23:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 420. [2024-10-14 13:23:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 359 states have (on average 1.3370473537604457) internal successors, (480), 362 states have internal predecessors, (480), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 13:23:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 584 transitions. [2024-10-14 13:23:32,062 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 584 transitions. Word has length 138 [2024-10-14 13:23:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:32,063 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 584 transitions. [2024-10-14 13:23:32,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 584 transitions. [2024-10-14 13:23:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 13:23:32,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:32,064 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:32,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 13:23:32,064 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:32,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:32,065 INFO L85 PathProgramCache]: Analyzing trace with hash -564823275, now seen corresponding path program 1 times [2024-10-14 13:23:32,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:23:32,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657957808] [2024-10-14 13:23:32,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:32,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:23:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:23:32,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [90019330] [2024-10-14 13:23:32,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:32,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:23:32,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:23:32,117 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:23:32,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 13:23:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:23:32,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 13:23:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:23:32,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 13:23:32,686 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 13:23:32,687 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:23:32,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 13:23:32,889 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,SelfDestructingSolverStorable12 [2024-10-14 13:23:32,892 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:32,983 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:23:32,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:23:32 BoogieIcfgContainer [2024-10-14 13:23:32,986 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:23:32,986 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:23:32,986 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:23:32,986 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:23:32,986 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:23:21" (3/4) ... [2024-10-14 13:23:32,988 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 13:23:32,989 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:23:32,992 INFO L158 Benchmark]: Toolchain (without parser) took 12747.44ms. Allocated memory was 159.4MB in the beginning and 482.3MB in the end (delta: 323.0MB). Free memory was 89.1MB in the beginning and 179.6MB in the end (delta: -90.5MB). Peak memory consumption was 234.0MB. Max. memory is 16.1GB. [2024-10-14 13:23:32,992 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:23:32,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.32ms. Allocated memory is still 159.4MB. Free memory was 89.0MB in the beginning and 127.7MB in the end (delta: -38.8MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-10-14 13:23:32,993 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.08ms. Allocated memory is still 159.4MB. Free memory was 127.7MB in the beginning and 122.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 13:23:32,993 INFO L158 Benchmark]: Boogie Preprocessor took 88.22ms. Allocated memory is still 159.4MB. Free memory was 122.4MB in the beginning and 117.1MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:23:32,993 INFO L158 Benchmark]: RCFGBuilder took 656.47ms. Allocated memory is still 159.4MB. Free memory was 116.1MB in the beginning and 73.0MB in the end (delta: 43.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-14 13:23:32,993 INFO L158 Benchmark]: TraceAbstraction took 11606.71ms. Allocated memory was 159.4MB in the beginning and 482.3MB in the end (delta: 323.0MB). Free memory was 72.1MB in the beginning and 179.6MB in the end (delta: -107.5MB). Peak memory consumption was 214.3MB. Max. memory is 16.1GB. [2024-10-14 13:23:32,993 INFO L158 Benchmark]: Witness Printer took 6.07ms. Allocated memory is still 482.3MB. Free memory is still 179.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:23:32,994 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.13ms. Allocated memory is still 159.4MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.32ms. Allocated memory is still 159.4MB. Free memory was 89.0MB in the beginning and 127.7MB in the end (delta: -38.8MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.08ms. Allocated memory is still 159.4MB. Free memory was 127.7MB in the beginning and 122.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.22ms. Allocated memory is still 159.4MB. Free memory was 122.4MB in the beginning and 117.1MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 656.47ms. Allocated memory is still 159.4MB. Free memory was 116.1MB in the beginning and 73.0MB in the end (delta: 43.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11606.71ms. Allocated memory was 159.4MB in the beginning and 482.3MB in the end (delta: 323.0MB). Free memory was 72.1MB in the beginning and 179.6MB in the end (delta: -107.5MB). Peak memory consumption was 214.3MB. Max. memory is 16.1GB. * Witness Printer took 6.07ms. Allocated memory is still 482.3MB. Free memory is still 179.6MB. 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 someBinaryFLOATComparisonOperation at line 105, overapproximation of someUnaryFLOAToperation at line 105, overapproximation of someBinaryArithmeticFLOAToperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] float float_Array_0[5] = { 127.8, 32.5, 256.6, 999.25, 1000000000.5 }; [L25-L27] float float_Array_0[5] = { 127.8, 32.5, 256.6, 999.25, 1000000000.5 }; [L25-L27] float float_Array_0[5] = { 127.8, 32.5, 256.6, 999.25, 1000000000.5 }; [L25-L27] float float_Array_0[5] = { 127.8, 32.5, 256.6, 999.25, 1000000000.5 }; [L25-L27] float float_Array_0[5] = { 127.8, 32.5, 256.6, 999.25, 1000000000.5 }; [L25-L27] float float_Array_0[5] = { 127.8, 32.5, 256.6, 999.25, 1000000000.5 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { 0 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { 0 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { -32, 8 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { -32, 8 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { -32, 8 }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 128}, {10, 64} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 128}, {10, 64} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 128}, {10, 64} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 128}, {10, 64} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 128}, {10, 64} }; [L37] signed long int last_1_signed_long_int_Array_0_0_ = 0; [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] CALL updateLastVariables() [L102] EXPR signed_long_int_Array_0[0] [L102] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L112] RET updateLastVariables() [L113] CALL updateVariables() [L74] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] float_Array_0[0] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[0] [L78] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F [L78] EXPR float_Array_0[0] [L78] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] RET assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] float_Array_0[3] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[3] [L80] EXPR float_Array_0[3] >= -461168.6018427382800e+13F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR float_Array_0[3] >= -461168.6018427382800e+13F && float_Array_0[3] <= -1.0e-20F [L80] EXPR float_Array_0[3] [L80] EXPR float_Array_0[3] >= -461168.6018427382800e+13F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[3] >= -461168.6018427382800e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[3] >= -461168.6018427382800e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[3] >= -461168.6018427382800e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[3] >= -461168.6018427382800e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] float_Array_0[4] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[4] [L82] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F [L82] EXPR float_Array_0[4] [L82] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] CALL assume_abort_if_not((float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] RET assume_abort_if_not((float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L84] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] CALL assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] RET assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L88] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] CALL assume_abort_if_not(signed_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] RET assume_abort_if_not(signed_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L92] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L93] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L95] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L96] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L97] unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L98] EXPR unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L99] EXPR unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L99] CALL assume_abort_if_not(unsigned_char_Array_0[0][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L99] RET assume_abort_if_not(unsigned_char_Array_0[0][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L113] RET updateVariables() [L114] CALL step() [L41] EXPR signed_short_int_Array_0[1] [L41] EXPR signed_short_int_Array_0[0] [L41] signed long int stepLocal_0 = (last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0]; [L42] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L42] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L47] EXPR unsigned_char_Array_0[0][0] [L47] unsigned_char_Array_0[1][1] = unsigned_char_Array_0[0][0] [L49] EXPR unsigned_char_Array_0[1][1] [L49] unsigned char stepLocal_2 = unsigned_char_Array_0[1][1]; [L50] EXPR unsigned_char_Array_0[1][1] [L50] EXPR unsigned_char_Array_0[1][1] [L50] signed long int stepLocal_1 = unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]; [L51] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L51] COND FALSE !(stepLocal_1 < signed_short_int_Array_0[0]) [L60] EXPR unsigned_char_Array_0[0][0] [L60] signed_long_int_Array_0[0] = unsigned_char_Array_0[0][0] [L62] EXPR unsigned_char_Array_0[1][1] [L62] unsigned char stepLocal_4 = unsigned_char_Array_0[1][1]; [L63] EXPR unsigned_char_Array_0[0][0] [L63] EXPR signed_short_int_Array_0[1] [L63] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L63] EXPR (unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=0, stepLocal_2=263, stepLocal_4=263, unsigned_char_Array_0={8:0}] [L63] signed long int stepLocal_3 = (unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0]; [L64] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L64] COND FALSE !(stepLocal_4 > signed_long_int_Array_0[0]) [L69] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) [L69] EXPR float_Array_0[0] [L69] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=0, stepLocal_2=263, stepLocal_3=0, unsigned_char_Array_0={8:0}] [L69] EXPR float_Array_0[4] [L69] float_Array_0[1] = (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4]) [L71] EXPR float_Array_0[4] [L71] float_Array_0[2] = float_Array_0[4] [L114] RET step() [L115] CALL, EXPR property() [L105] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0])) [L105] EXPR unsigned_char_Array_0[1][1] [L105] EXPR unsigned_char_Array_0[0][0] [L105] EXPR BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0]))) [L105] EXPR unsigned_char_Array_0[1][1] [L105] EXPR unsigned_char_Array_0[1][1] [L105] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR ((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])) [L105] EXPR signed_long_int_Array_0[0] [L105] EXPR unsigned_char_Array_0[0][0] [L105] EXPR ((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR ((BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])))) && ((unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR ((BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])))) && ((unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4])))) [L105] EXPR unsigned_char_Array_0[1][1] [L105] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR (unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4]))) [L105] EXPR float_Array_0[1] [L105] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) [L105] EXPR float_Array_0[0] [L105] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR float_Array_0[4] [L105] EXPR (unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR ((BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])))) && ((unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR (((BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])))) && ((unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4]))))) && (float_Array_0[2] == ((float) float_Array_0[4])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] EXPR (((BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])))) && ((unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4]))))) && (float_Array_0[2] == ((float) float_Array_0[4])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105-L106] return (((BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_long_int_Array_0_0_ > ((last_1_signed_long_int_Array_0_0_ / signed_short_int_Array_0[1]) % signed_short_int_Array_0[0])) ? (unsigned_char_Array_0[1][1] == ((unsigned char) ((((((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) > (unsigned_char_Array_0[0][0])) ? (((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))) : (unsigned_char_Array_0[0][0]))))) : 1) : (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) && (((unsigned_char_Array_0[1][1] + unsigned_char_Array_0[1][1]) < signed_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? ((signed_short_int_Array_0[1] > unsigned_char_Array_0[1][1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][1])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0][0])))) && ((unsigned_char_Array_0[1][1] > signed_long_int_Array_0[0]) ? ((unsigned_char_Array_0[1][1] <= ((unsigned_char_Array_0[0][0] / signed_short_int_Array_0[1]) << signed_short_int_Array_0[0])) ? (float_Array_0[1] == ((float) (float_Array_0[0] + float_Array_0[3]))) : 1) : (float_Array_0[1] == ((float) (((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))) - float_Array_0[4]))))) && (float_Array_0[2] == ((float) float_Array_0[4])) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 13, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1785 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1778 mSDsluCounter, 11456 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9136 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3268 IncrementalHoareTripleChecker+Invalid, 3339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 2320 mSDtfsCounter, 3268 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 568 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=455occurred in iteration=11, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 833 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1892 NumberOfCodeBlocks, 1892 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1602 ConstructedInterpolants, 0 QuantifiedInterpolants, 4137 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 6528/6528 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-10-14 13:23:33,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.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 6b58d24144d549c81ae478cdbe56bd6625ad814c6ede850dce7ec3284e5d3039 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:23:35,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:23:35,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 13:23:35,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:23:35,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:23:35,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:23:35,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:23:35,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:23:35,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:23:35,196 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:23:35,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:23:35,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:23:35,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:23:35,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:23:35,198 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:23:35,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:23:35,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:23:35,198 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:23:35,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:23:35,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:23:35,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:23:35,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:23:35,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:23:35,200 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 13:23:35,200 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 13:23:35,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:23:35,201 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 13:23:35,201 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:23:35,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:23:35,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:23:35,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:23:35,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:23:35,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:23:35,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:23:35,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:23:35,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:23:35,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:23:35,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:23:35,204 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 13:23:35,204 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 13:23:35,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:23:35,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:23:35,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:23:35,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:23:35,208 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 13:23:35,208 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 -> 6b58d24144d549c81ae478cdbe56bd6625ad814c6ede850dce7ec3284e5d3039 [2024-10-14 13:23:35,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:23:35,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:23:35,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:23:35,467 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:23:35,469 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:23:35,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i [2024-10-14 13:23:36,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:23:36,989 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:23:36,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i [2024-10-14 13:23:36,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5426a9d77/820b0e2680554ae7a5fd1cf53f184462/FLAG13a120646 [2024-10-14 13:23:37,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5426a9d77/820b0e2680554ae7a5fd1cf53f184462 [2024-10-14 13:23:37,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:23:37,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:23:37,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:23:37,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:23:37,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:23:37,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:23:37" (1/1) ... [2024-10-14 13:23:37,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39f2ae77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:37, skipping insertion in model container [2024-10-14 13:23:37,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:23:37" (1/1) ... [2024-10-14 13:23:37,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:23:37,549 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i[916,929] [2024-10-14 13:23:37,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:23:37,650 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:23:37,661 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-30.i[916,929] [2024-10-14 13:23:37,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:23:37,748 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:23:37,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:37 WrapperNode [2024-10-14 13:23:37,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:23:37,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:23:37,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:23:37,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:23:37,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:37" (1/1) ... [2024-10-14 13:23:37,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:37" (1/1) ... [2024-10-14 13:23:37,822 INFO L138 Inliner]: procedures = 36, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 509 [2024-10-14 13:23:37,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:23:37,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:23:37,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:23:37,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:23:37,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:37" (1/1) ... [2024-10-14 13:23:37,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:37" (1/1) ... [2024-10-14 13:23:37,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:37" (1/1) ... [2024-10-14 13:23:37,863 INFO L175 MemorySlicer]: Split 139 memory accesses to 6 slices as follows [2, 8, 40, 10, 22, 57]. 41 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 5, 1, 2, 4]. The 17 writes are split as follows [0, 1, 6, 3, 2, 5]. [2024-10-14 13:23:37,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:37" (1/1) ... [2024-10-14 13:23:37,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:37" (1/1) ... [2024-10-14 13:23:37,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:37" (1/1) ... [2024-10-14 13:23:37,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:37" (1/1) ... [2024-10-14 13:23:37,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:37" (1/1) ... [2024-10-14 13:23:37,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:37" (1/1) ... [2024-10-14 13:23:37,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:23:37,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:23:37,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:23:37,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:23:37,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:37" (1/1) ... [2024-10-14 13:23:37,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:23:37,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:23:37,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:23:37,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:23:37,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:23:37,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 13:23:37,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 13:23:37,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 13:23:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-14 13:23:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-14 13:23:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-14 13:23:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-14 13:23:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-14 13:23:37,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-14 13:23:37,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-14 13:23:37,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-14 13:23:37,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-14 13:23:37,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 13:23:37,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 13:23:37,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 13:23:37,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-14 13:23:37,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-14 13:23:37,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-14 13:23:37,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-14 13:23:37,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-14 13:23:37,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-14 13:23:37,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-14 13:23:37,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-14 13:23:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-14 13:23:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-14 13:23:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-14 13:23:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-14 13:23:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-14 13:23:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-14 13:23:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-14 13:23:37,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 13:23:37,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 13:23:37,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 13:23:37,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-14 13:23:37,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-14 13:23:37,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-14 13:23:37,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-14 13:23:37,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-14 13:23:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-14 13:23:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-14 13:23:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-14 13:23:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-14 13:23:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-14 13:23:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-14 13:23:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-14 13:23:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-14 13:23:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-14 13:23:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-14 13:23:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-14 13:23:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-14 13:23:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-14 13:23:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-14 13:23:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-14 13:23:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-14 13:23:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:23:37,975 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:23:37,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:23:37,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:23:37,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 13:23:37,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 13:23:37,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-14 13:23:37,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-14 13:23:37,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-14 13:23:37,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-14 13:23:37,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-14 13:23:37,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-14 13:23:37,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-14 13:23:37,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-14 13:23:37,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-14 13:23:37,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-14 13:23:37,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 13:23:37,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 13:23:37,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 13:23:37,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-14 13:23:37,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-14 13:23:37,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-14 13:23:38,102 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:23:38,104 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:23:38,894 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2024-10-14 13:23:38,894 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:23:38,937 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:23:38,937 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:23:38,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:23:38 BoogieIcfgContainer [2024-10-14 13:23:38,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:23:38,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:23:38,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:23:38,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:23:38,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:23:37" (1/3) ... [2024-10-14 13:23:38,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3caa3b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:23:38, skipping insertion in model container [2024-10-14 13:23:38,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:23:37" (2/3) ... [2024-10-14 13:23:38,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3caa3b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:23:38, skipping insertion in model container [2024-10-14 13:23:38,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:23:38" (3/3) ... [2024-10-14 13:23:38,944 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-30.i [2024-10-14 13:23:38,956 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:23:38,956 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:23:39,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:23:39,034 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;@1c5d1e62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:23:39,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:23:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:23:39,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:23:39,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:39,051 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:39,052 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:39,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash 549758872, now seen corresponding path program 1 times [2024-10-14 13:23:39,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:23:39,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499894703] [2024-10-14 13:23:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:39,068 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-10-14 13:23:39,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:23:39,073 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-10-14 13:23:39,074 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-10-14 13:23:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:39,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 13:23:39,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:23:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-14 13:23:39,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:23:39,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:23:39,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499894703] [2024-10-14 13:23:39,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499894703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:39,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:39,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:23:39,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104039757] [2024-10-14 13:23:39,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:39,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:23:39,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:23:39,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:23:39,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:23:39,508 INFO L87 Difference]: Start difference. First operand has 107 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:39,567 INFO L93 Difference]: Finished difference Result 211 states and 335 transitions. [2024-10-14 13:23:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:23:39,569 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-14 13:23:39,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:39,574 INFO L225 Difference]: With dead ends: 211 [2024-10-14 13:23:39,574 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 13:23:39,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-10-14 13:23:39,579 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:39,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:23:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 13:23:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-14 13:23:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:23:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2024-10-14 13:23:39,625 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 130 [2024-10-14 13:23:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:39,633 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2024-10-14 13:23:39,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2024-10-14 13:23:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:23:39,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:39,636 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:39,648 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 (2)] Ended with exit code 0 [2024-10-14 13:23:39,837 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-10-14 13:23:39,837 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:39,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:39,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1341186962, now seen corresponding path program 1 times [2024-10-14 13:23:39,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:23:39,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734694649] [2024-10-14 13:23:39,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:39,839 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-10-14 13:23:39,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:23:39,843 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-10-14 13:23:39,844 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-10-14 13:23:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:40,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 13:23:40,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:23:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-14 13:23:40,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:23:40,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:23:40,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734694649] [2024-10-14 13:23:40,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734694649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:40,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:40,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:23:40,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432317284] [2024-10-14 13:23:40,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:40,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:23:40,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:23:40,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:23:40,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:23:40,254 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:40,333 INFO L93 Difference]: Finished difference Result 211 states and 312 transitions. [2024-10-14 13:23:40,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:23:40,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-14 13:23:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:40,336 INFO L225 Difference]: With dead ends: 211 [2024-10-14 13:23:40,336 INFO L226 Difference]: Without dead ends: 107 [2024-10-14 13:23:40,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 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-10-14 13:23:40,337 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 437 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:40,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 437 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:23:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-14 13:23:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-14 13:23:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 88 states have internal predecessors, (123), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:23:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2024-10-14 13:23:40,349 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 130 [2024-10-14 13:23:40,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:40,350 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 157 transitions. [2024-10-14 13:23:40,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 157 transitions. [2024-10-14 13:23:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:23:40,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:40,353 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:40,365 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-10-14 13:23:40,556 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-10-14 13:23:40,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:40,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:40,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1008543824, now seen corresponding path program 1 times [2024-10-14 13:23:40,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:23:40,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989570491] [2024-10-14 13:23:40,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:40,558 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-10-14 13:23:40,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:23:40,561 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-10-14 13:23:40,563 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-10-14 13:23:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:40,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:23:40,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:23:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:40,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:23:40,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:23:40,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989570491] [2024-10-14 13:23:40,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989570491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:40,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:40,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:23:40,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703043714] [2024-10-14 13:23:40,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:40,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:23:40,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:23:40,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:23:40,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:23:40,927 INFO L87 Difference]: Start difference. First operand 107 states and 157 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:41,028 INFO L93 Difference]: Finished difference Result 218 states and 320 transitions. [2024-10-14 13:23:41,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:23:41,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-14 13:23:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:41,030 INFO L225 Difference]: With dead ends: 218 [2024-10-14 13:23:41,030 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 13:23:41,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 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-10-14 13:23:41,032 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:41,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 577 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:23:41,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 13:23:41,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-14 13:23:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 92 states have internal predecessors, (127), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:23:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-10-14 13:23:41,039 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 130 [2024-10-14 13:23:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:41,039 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-10-14 13:23:41,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-10-14 13:23:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:23:41,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:41,041 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:41,053 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-10-14 13:23:41,241 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-10-14 13:23:41,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:41,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1008484242, now seen corresponding path program 1 times [2024-10-14 13:23:41,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:23:41,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502211213] [2024-10-14 13:23:41,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:41,244 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-10-14 13:23:41,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:23:41,246 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-10-14 13:23:41,247 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-10-14 13:23:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:41,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 13:23:41,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:23:41,685 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 95 treesize of output 41 [2024-10-14 13:23:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-10-14 13:23:41,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:23:41,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:23:41,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502211213] [2024-10-14 13:23:41,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502211213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:41,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:41,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:23:41,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110072301] [2024-10-14 13:23:41,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:41,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:23:41,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:23:41,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:23:41,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:23:41,715 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:42,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:42,252 INFO L93 Difference]: Finished difference Result 222 states and 322 transitions. [2024-10-14 13:23:42,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:23:42,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-14 13:23:42,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:42,253 INFO L225 Difference]: With dead ends: 222 [2024-10-14 13:23:42,253 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 13:23:42,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:23:42,255 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 131 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:42,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 469 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 13:23:42,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 13:23:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-14 13:23:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:23:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2024-10-14 13:23:42,263 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 130 [2024-10-14 13:23:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:42,263 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2024-10-14 13:23:42,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:23:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2024-10-14 13:23:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:23:42,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:42,265 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:42,276 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 (5)] Ended with exit code 0 [2024-10-14 13:23:42,465 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-10-14 13:23:42,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:42,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:42,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1305869992, now seen corresponding path program 1 times [2024-10-14 13:23:42,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:23:42,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135732004] [2024-10-14 13:23:42,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:42,467 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-10-14 13:23:42,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:23:42,470 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-10-14 13:23:42,472 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-10-14 13:23:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:42,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 13:23:42,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:23:42,926 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-10-14 13:23:42,933 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 19 treesize of output 19 [2024-10-14 13:23:42,951 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 17 treesize of output 13 [2024-10-14 13:23:42,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:23:42,986 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 39 treesize of output 19 [2024-10-14 13:23:42,990 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-10-14 13:23:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:43,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:23:43,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:23:43,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135732004] [2024-10-14 13:23:43,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135732004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:43,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:43,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:23:43,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7495911] [2024-10-14 13:23:43,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:43,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:23:43,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:23:43,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:23:43,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:23:43,012 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:43,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:43,466 INFO L93 Difference]: Finished difference Result 396 states and 566 transitions. [2024-10-14 13:23:43,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:23:43,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-14 13:23:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:43,468 INFO L225 Difference]: With dead ends: 396 [2024-10-14 13:23:43,468 INFO L226 Difference]: Without dead ends: 286 [2024-10-14 13:23:43,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:23:43,469 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 229 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:43,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 626 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:23:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-14 13:23:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 200. [2024-10-14 13:23:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 169 states have (on average 1.3727810650887573) internal successors, (232), 170 states have internal predecessors, (232), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:23:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 288 transitions. [2024-10-14 13:23:43,495 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 288 transitions. Word has length 132 [2024-10-14 13:23:43,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:43,495 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 288 transitions. [2024-10-14 13:23:43,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 288 transitions. [2024-10-14 13:23:43,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 13:23:43,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:43,497 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:43,510 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-10-14 13:23:43,700 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-10-14 13:23:43,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:43,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:43,701 INFO L85 PathProgramCache]: Analyzing trace with hash -215833220, now seen corresponding path program 1 times [2024-10-14 13:23:43,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:23:43,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829870201] [2024-10-14 13:23:43,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:43,702 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-10-14 13:23:43,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:23:43,706 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-10-14 13:23:43,708 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-10-14 13:23:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:44,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 13:23:44,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:23:44,169 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-10-14 13:23:44,174 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-10-14 13:23:44,182 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-10-14 13:23:44,188 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 19 treesize of output 19 [2024-10-14 13:23:44,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:23:44,230 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 60 treesize of output 30 [2024-10-14 13:23:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:44,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:23:44,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:23:44,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829870201] [2024-10-14 13:23:44,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829870201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:44,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:44,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:23:44,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134475800] [2024-10-14 13:23:44,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:44,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:23:44,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:23:44,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:23:44,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:23:44,252 INFO L87 Difference]: Start difference. First operand 200 states and 288 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:44,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:44,555 INFO L93 Difference]: Finished difference Result 404 states and 580 transitions. [2024-10-14 13:23:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:23:44,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-14 13:23:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:44,557 INFO L225 Difference]: With dead ends: 404 [2024-10-14 13:23:44,557 INFO L226 Difference]: Without dead ends: 205 [2024-10-14 13:23:44,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 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-10-14 13:23:44,558 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 116 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:44,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 684 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:23:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-14 13:23:44,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2024-10-14 13:23:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 171 states have (on average 1.368421052631579) internal successors, (234), 172 states have internal predecessors, (234), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:23:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 290 transitions. [2024-10-14 13:23:44,583 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 290 transitions. Word has length 133 [2024-10-14 13:23:44,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:44,583 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 290 transitions. [2024-10-14 13:23:44,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:44,583 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 290 transitions. [2024-10-14 13:23:44,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 13:23:44,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:44,584 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:44,599 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 (7)] Ended with exit code 0 [2024-10-14 13:23:44,785 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-10-14 13:23:44,785 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:44,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:44,786 INFO L85 PathProgramCache]: Analyzing trace with hash 476540879, now seen corresponding path program 1 times [2024-10-14 13:23:44,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:23:44,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152312536] [2024-10-14 13:23:44,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:44,786 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-10-14 13:23:44,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:23:44,789 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-10-14 13:23:44,790 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-10-14 13:23:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:45,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 13:23:45,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:23:45,339 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 27 treesize of output 15 [2024-10-14 13:23:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 78 proven. 45 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-10-14 13:23:45,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:23:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:45,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:23:45,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152312536] [2024-10-14 13:23:45,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152312536] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:23:45,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:23:45,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-14 13:23:45,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287106866] [2024-10-14 13:23:45,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:45,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:23:45,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:23:45,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:23:45,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:23:45,553 INFO L87 Difference]: Start difference. First operand 202 states and 290 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:45,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:45,753 INFO L93 Difference]: Finished difference Result 406 states and 581 transitions. [2024-10-14 13:23:45,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:23:45,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-14 13:23:45,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:45,756 INFO L225 Difference]: With dead ends: 406 [2024-10-14 13:23:45,756 INFO L226 Difference]: Without dead ends: 205 [2024-10-14 13:23:45,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:23:45,757 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 66 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:45,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 670 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:23:45,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-14 13:23:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2024-10-14 13:23:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 171 states have (on average 1.3625730994152048) internal successors, (233), 172 states have internal predecessors, (233), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:23:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 289 transitions. [2024-10-14 13:23:45,770 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 289 transitions. Word has length 133 [2024-10-14 13:23:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:45,770 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 289 transitions. [2024-10-14 13:23:45,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 289 transitions. [2024-10-14 13:23:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:23:45,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:45,772 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:45,791 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-10-14 13:23:45,975 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-10-14 13:23:45,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:45,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:45,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1136756561, now seen corresponding path program 1 times [2024-10-14 13:23:45,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:23:45,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833404490] [2024-10-14 13:23:45,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:45,978 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-10-14 13:23:45,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:23:45,980 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-10-14 13:23:45,981 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-10-14 13:23:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:46,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 13:23:46,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:23:46,311 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 17 treesize of output 13 [2024-10-14 13:23:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:46,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:23:46,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:23:46,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833404490] [2024-10-14 13:23:46,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833404490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:46,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:46,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:23:46,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015985988] [2024-10-14 13:23:46,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:46,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:23:46,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:23:46,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:23:46,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:23:46,402 INFO L87 Difference]: Start difference. First operand 202 states and 289 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:46,763 INFO L93 Difference]: Finished difference Result 579 states and 823 transitions. [2024-10-14 13:23:46,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:23:46,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-14 13:23:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:46,767 INFO L225 Difference]: With dead ends: 579 [2024-10-14 13:23:46,767 INFO L226 Difference]: Without dead ends: 378 [2024-10-14 13:23:46,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:23:46,768 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 109 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:46,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 865 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:23:46,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-14 13:23:46,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 231. [2024-10-14 13:23:46,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 200 states have (on average 1.365) internal successors, (273), 201 states have internal predecessors, (273), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:23:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 329 transitions. [2024-10-14 13:23:46,786 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 329 transitions. Word has length 135 [2024-10-14 13:23:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:46,788 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 329 transitions. [2024-10-14 13:23:46,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 329 transitions. [2024-10-14 13:23:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:23:46,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:46,789 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:46,808 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-10-14 13:23:46,989 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-10-14 13:23:46,990 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:46,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1131588984, now seen corresponding path program 1 times [2024-10-14 13:23:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:23:46,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720264157] [2024-10-14 13:23:46,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:46,990 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-10-14 13:23:46,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:23:46,992 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-10-14 13:23:46,993 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-10-14 13:23:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:47,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 13:23:47,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:23:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 78 proven. 45 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-10-14 13:23:47,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:23:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:47,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:23:47,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720264157] [2024-10-14 13:23:47,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720264157] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:23:47,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:23:47,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-10-14 13:23:47,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164832009] [2024-10-14 13:23:47,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:47,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:23:47,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:23:47,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:23:47,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:23:47,678 INFO L87 Difference]: Start difference. First operand 231 states and 329 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:47,770 INFO L93 Difference]: Finished difference Result 479 states and 678 transitions. [2024-10-14 13:23:47,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:23:47,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-14 13:23:47,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:47,772 INFO L225 Difference]: With dead ends: 479 [2024-10-14 13:23:47,772 INFO L226 Difference]: Without dead ends: 249 [2024-10-14 13:23:47,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:23:47,772 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 84 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:47,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 430 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:23:47,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-14 13:23:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 221. [2024-10-14 13:23:47,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 190 states have (on average 1.3473684210526315) internal successors, (256), 191 states have internal predecessors, (256), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:23:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 312 transitions. [2024-10-14 13:23:47,783 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 312 transitions. Word has length 135 [2024-10-14 13:23:47,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:47,783 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 312 transitions. [2024-10-14 13:23:47,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 312 transitions. [2024-10-14 13:23:47,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:23:47,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:47,785 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:47,803 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-10-14 13:23:47,989 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-10-14 13:23:47,990 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:47,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:47,991 INFO L85 PathProgramCache]: Analyzing trace with hash -866236730, now seen corresponding path program 1 times [2024-10-14 13:23:47,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:23:47,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643167700] [2024-10-14 13:23:47,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:47,992 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-10-14 13:23:47,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:23:47,994 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-10-14 13:23:47,995 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-10-14 13:23:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:48,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 13:23:48,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:23:48,369 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 15 [2024-10-14 13:23:48,474 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 23 treesize of output 15 [2024-10-14 13:23:49,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:23:49,365 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 94 treesize of output 54 [2024-10-14 13:23:49,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:23:49,378 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 47 treesize of output 29 [2024-10-14 13:23:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:49,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:23:49,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:23:49,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643167700] [2024-10-14 13:23:49,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643167700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:49,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:49,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:23:49,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98692974] [2024-10-14 13:23:49,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:49,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:23:49,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:23:49,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:23:49,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:23:49,784 INFO L87 Difference]: Start difference. First operand 221 states and 312 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:55,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:55,452 INFO L93 Difference]: Finished difference Result 789 states and 1100 transitions. [2024-10-14 13:23:55,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:23:55,454 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-14 13:23:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:55,456 INFO L225 Difference]: With dead ends: 789 [2024-10-14 13:23:55,456 INFO L226 Difference]: Without dead ends: 569 [2024-10-14 13:23:55,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:23:55,457 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 294 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:55,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1546 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-14 13:23:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-10-14 13:23:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 327. [2024-10-14 13:23:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 284 states have (on average 1.3485915492957747) internal successors, (383), 287 states have internal predecessors, (383), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 13:23:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 459 transitions. [2024-10-14 13:23:55,478 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 459 transitions. Word has length 135 [2024-10-14 13:23:55,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:55,478 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 459 transitions. [2024-10-14 13:23:55,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:55,478 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 459 transitions. [2024-10-14 13:23:55,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:23:55,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:55,479 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:55,492 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-10-14 13:23:55,683 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-10-14 13:23:55,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:55,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:55,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1877353980, now seen corresponding path program 1 times [2024-10-14 13:23:55,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:23:55,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973639307] [2024-10-14 13:23:55,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:55,685 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-10-14 13:23:55,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:23:55,687 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-10-14 13:23:55,688 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-10-14 13:23:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:55,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 13:23:55,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:23:56,034 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 40 treesize of output 22 [2024-10-14 13:23:56,037 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 22 treesize of output 14 [2024-10-14 13:23:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:56,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:23:56,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:23:56,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973639307] [2024-10-14 13:23:56,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973639307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:56,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:56,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:23:56,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838001695] [2024-10-14 13:23:56,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:56,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:23:56,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:23:56,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:23:56,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:23:56,078 INFO L87 Difference]: Start difference. First operand 327 states and 459 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:56,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:56,689 INFO L93 Difference]: Finished difference Result 630 states and 880 transitions. [2024-10-14 13:23:56,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:23:56,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-14 13:23:56,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:56,691 INFO L225 Difference]: With dead ends: 630 [2024-10-14 13:23:56,692 INFO L226 Difference]: Without dead ends: 331 [2024-10-14 13:23:56,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:23:56,692 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 92 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:56,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 689 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 13:23:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-14 13:23:56,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 303. [2024-10-14 13:23:56,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 260 states have (on average 1.3384615384615384) internal successors, (348), 263 states have internal predecessors, (348), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 13:23:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 424 transitions. [2024-10-14 13:23:56,703 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 424 transitions. Word has length 135 [2024-10-14 13:23:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:56,703 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 424 transitions. [2024-10-14 13:23:56,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 424 transitions. [2024-10-14 13:23:56,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:23:56,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:56,704 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:56,715 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 (12)] Ended with exit code 0 [2024-10-14 13:23:56,908 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-10-14 13:23:56,909 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:56,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:56,909 INFO L85 PathProgramCache]: Analyzing trace with hash 783167243, now seen corresponding path program 1 times [2024-10-14 13:23:56,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:23:56,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255153741] [2024-10-14 13:23:56,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:56,910 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-10-14 13:23:56,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:23:56,912 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-10-14 13:23:56,913 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-10-14 13:23:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:57,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:23:57,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:23:57,241 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:57,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:23:57,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:23:57,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255153741] [2024-10-14 13:23:57,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255153741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:57,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:57,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:23:57,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853266242] [2024-10-14 13:23:57,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:57,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:23:57,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:23:57,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:23:57,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:23:57,243 INFO L87 Difference]: Start difference. First operand 303 states and 424 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:57,319 INFO L93 Difference]: Finished difference Result 584 states and 815 transitions. [2024-10-14 13:23:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:23:57,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-14 13:23:57,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:57,321 INFO L225 Difference]: With dead ends: 584 [2024-10-14 13:23:57,321 INFO L226 Difference]: Without dead ends: 309 [2024-10-14 13:23:57,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 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-10-14 13:23:57,322 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:57,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 583 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:23:57,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-14 13:23:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2024-10-14 13:23:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 264 states have (on average 1.3333333333333333) internal successors, (352), 267 states have internal predecessors, (352), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 13:23:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 428 transitions. [2024-10-14 13:23:57,332 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 428 transitions. Word has length 135 [2024-10-14 13:23:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:57,332 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 428 transitions. [2024-10-14 13:23:57,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 428 transitions. [2024-10-14 13:23:57,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-14 13:23:57,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:57,333 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:57,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 (13)] Forceful destruction successful, exit code 0 [2024-10-14 13:23:57,534 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-10-14 13:23:57,534 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:57,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:57,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1438924573, now seen corresponding path program 1 times [2024-10-14 13:23:57,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:23:57,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426192758] [2024-10-14 13:23:57,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:57,536 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-10-14 13:23:57,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:23:57,538 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-10-14 13:23:57,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 (14)] Waiting until timeout for monitored process [2024-10-14 13:23:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:57,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 13:23:57,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:23:57,907 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 41 treesize of output 23 [2024-10-14 13:23:57,910 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 23 treesize of output 15 [2024-10-14 13:23:57,953 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:57,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:23:57,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:23:57,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426192758] [2024-10-14 13:23:57,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426192758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:57,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:57,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:23:57,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436697284] [2024-10-14 13:23:57,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:57,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:23:57,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:23:57,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:23:57,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:23:57,955 INFO L87 Difference]: Start difference. First operand 307 states and 428 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:58,515 INFO L93 Difference]: Finished difference Result 591 states and 814 transitions. [2024-10-14 13:23:58,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:23:58,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-10-14 13:23:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:58,517 INFO L225 Difference]: With dead ends: 591 [2024-10-14 13:23:58,517 INFO L226 Difference]: Without dead ends: 312 [2024-10-14 13:23:58,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:23:58,517 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 82 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:58,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 482 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 13:23:58,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-14 13:23:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 233. [2024-10-14 13:23:58,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 200 states have (on average 1.315) internal successors, (263), 201 states have internal predecessors, (263), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:23:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 319 transitions. [2024-10-14 13:23:58,526 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 319 transitions. Word has length 137 [2024-10-14 13:23:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:58,527 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 319 transitions. [2024-10-14 13:23:58,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 319 transitions. [2024-10-14 13:23:58,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-14 13:23:58,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:58,528 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:58,539 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 (14)] Forceful destruction successful, exit code 0 [2024-10-14 13:23:58,732 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-10-14 13:23:58,733 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:58,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:58,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2124838680, now seen corresponding path program 1 times [2024-10-14 13:23:58,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:23:58,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51279196] [2024-10-14 13:23:58,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:58,734 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-10-14 13:23:58,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:23:58,736 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-10-14 13:23:58,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 (15)] Waiting until timeout for monitored process [2024-10-14 13:23:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:23:59,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 13:23:59,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:23:59,039 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 15 [2024-10-14 13:23:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:23:59,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:23:59,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:23:59,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51279196] [2024-10-14 13:23:59,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51279196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:23:59,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:23:59,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:23:59,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119635084] [2024-10-14 13:23:59,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:23:59,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:23:59,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:23:59,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:23:59,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:23:59,117 INFO L87 Difference]: Start difference. First operand 233 states and 319 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:23:59,505 INFO L93 Difference]: Finished difference Result 647 states and 883 transitions. [2024-10-14 13:23:59,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:23:59,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-10-14 13:23:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:23:59,508 INFO L225 Difference]: With dead ends: 647 [2024-10-14 13:23:59,508 INFO L226 Difference]: Without dead ends: 415 [2024-10-14 13:23:59,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:23:59,509 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 114 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:23:59,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1258 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:23:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-14 13:23:59,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 412. [2024-10-14 13:23:59,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 351 states have (on average 1.3019943019943019) internal successors, (457), 354 states have internal predecessors, (457), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 13:23:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 561 transitions. [2024-10-14 13:23:59,523 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 561 transitions. Word has length 137 [2024-10-14 13:23:59,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:23:59,524 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 561 transitions. [2024-10-14 13:23:59,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:23:59,524 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 561 transitions. [2024-10-14 13:23:59,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 13:23:59,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:23:59,525 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:23:59,538 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 (15)] Ended with exit code 0 [2024-10-14 13:23:59,728 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-10-14 13:23:59,729 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:23:59,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:23:59,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1261640154, now seen corresponding path program 1 times [2024-10-14 13:23:59,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:23:59,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469620545] [2024-10-14 13:23:59,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:23:59,731 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-10-14 13:23:59,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:23:59,733 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-10-14 13:23:59,734 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-10-14 13:23:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:24:00,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 13:24:00,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:24:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 78 proven. 45 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-10-14 13:24:00,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:24:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:24:00,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:24:00,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469620545] [2024-10-14 13:24:00,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469620545] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:24:00,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:24:00,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-10-14 13:24:00,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775122701] [2024-10-14 13:24:00,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:24:00,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:24:00,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:24:00,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:24:00,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:24:00,338 INFO L87 Difference]: Start difference. First operand 412 states and 561 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:24:00,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:24:00,423 INFO L93 Difference]: Finished difference Result 824 states and 1119 transitions. [2024-10-14 13:24:00,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:24:00,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-10-14 13:24:00,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:24:00,425 INFO L225 Difference]: With dead ends: 824 [2024-10-14 13:24:00,425 INFO L226 Difference]: Without dead ends: 413 [2024-10-14 13:24:00,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:24:00,426 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 44 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:24:00,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 573 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:24:00,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-14 13:24:00,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 392. [2024-10-14 13:24:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 331 states have (on average 1.29607250755287) internal successors, (429), 334 states have internal predecessors, (429), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 13:24:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 533 transitions. [2024-10-14 13:24:00,441 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 533 transitions. Word has length 138 [2024-10-14 13:24:00,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:24:00,441 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 533 transitions. [2024-10-14 13:24:00,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:24:00,442 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 533 transitions. [2024-10-14 13:24:00,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 13:24:00,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:24:00,442 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:24:00,454 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 (16)] Forceful destruction successful, exit code 0 [2024-10-14 13:24:00,646 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-10-14 13:24:00,647 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:24:00,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:24:00,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1770915643, now seen corresponding path program 1 times [2024-10-14 13:24:00,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:24:00,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013911617] [2024-10-14 13:24:00,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:24:00,648 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-10-14 13:24:00,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:24:00,651 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-10-14 13:24:00,651 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-10-14 13:24:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:24:01,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 13:24:01,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:24:01,153 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-10-14 13:24:01,856 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 78 treesize of output 32 [2024-10-14 13:24:01,865 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 129 treesize of output 65 [2024-10-14 13:24:02,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:24:02,030 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 219 treesize of output 75 [2024-10-14 13:24:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 12 proven. 244 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-14 13:24:02,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:24:02,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:24:02,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013911617] [2024-10-14 13:24:02,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013911617] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:24:02,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1024238781] [2024-10-14 13:24:02,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:24:02,257 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 13:24:02,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 13:24:02,261 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 13:24:02,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-10-14 13:24:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:24:02,543 WARN L253 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 164 conjuncts are in the unsatisfiable core [2024-10-14 13:24:02,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:24:02,713 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-10-14 13:24:03,555 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 15 treesize of output 1 [2024-10-14 13:24:04,031 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 15 treesize of output 1 [2024-10-14 13:24:04,583 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 15 treesize of output 1 [2024-10-14 13:24:05,351 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-10-14 13:24:06,948 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 21 treesize of output 20 [2024-10-14 13:24:08,669 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-10-14 13:24:09,994 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 21 treesize of output 20 [2024-10-14 13:24:11,379 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 29 treesize of output 31 [2024-10-14 13:24:12,963 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-10-14 13:24:13,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2024-10-14 13:24:13,452 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 17 treesize of output 13 [2024-10-14 13:24:13,890 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 37 treesize of output 17 [2024-10-14 13:24:13,963 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 76 treesize of output 44 [2024-10-14 13:24:15,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 62 [2024-10-14 13:24:15,097 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 13:24:15,097 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:24:15,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [1024238781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:24:15,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:24:15,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [14] total 48 [2024-10-14 13:24:15,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386012227] [2024-10-14 13:24:15,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:24:15,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-14 13:24:15,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:24:15,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-14 13:24:15,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2308, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 13:24:15,105 INFO L87 Difference]: Start difference. First operand 392 states and 533 transitions. Second operand has 38 states, 22 states have (on average 3.409090909090909) internal successors, (75), 37 states have internal predecessors, (75), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 7 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:24:34,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:24:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:24:39,560 INFO L93 Difference]: Finished difference Result 1050 states and 1392 transitions. [2024-10-14 13:24:39,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-10-14 13:24:39,561 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 22 states have (on average 3.409090909090909) internal successors, (75), 37 states have internal predecessors, (75), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 7 states have call predecessors, (17), 17 states have call successors, (17) Word has length 139 [2024-10-14 13:24:39,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:24:39,575 INFO L225 Difference]: With dead ends: 1050 [2024-10-14 13:24:39,575 INFO L226 Difference]: Without dead ends: 1048 [2024-10-14 13:24:39,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2218 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=1228, Invalid=7514, Unknown=0, NotChecked=0, Total=8742 [2024-10-14 13:24:39,577 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 919 mSDsluCounter, 1907 mSDsCounter, 0 mSdLazyCounter, 4351 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 4515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 4351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:24:39,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 2005 Invalid, 4515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 4351 Invalid, 0 Unknown, 0 Unchecked, 17.4s Time] [2024-10-14 13:24:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2024-10-14 13:24:39,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 734. [2024-10-14 13:24:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 634 states have (on average 1.2981072555205047) internal successors, (823), 641 states have internal predecessors, (823), 81 states have call successors, (81), 18 states have call predecessors, (81), 18 states have return successors, (81), 74 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-14 13:24:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 985 transitions. [2024-10-14 13:24:39,687 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 985 transitions. Word has length 139 [2024-10-14 13:24:39,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:24:39,688 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 985 transitions. [2024-10-14 13:24:39,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 22 states have (on average 3.409090909090909) internal successors, (75), 37 states have internal predecessors, (75), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 7 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:24:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 985 transitions. [2024-10-14 13:24:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 13:24:39,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:24:39,689 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:24:39,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-10-14 13:24:39,910 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 (17)] Ended with exit code 0 [2024-10-14 13:24:40,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt,17 /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-10-14 13:24:40,095 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:24:40,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:24:40,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1770856061, now seen corresponding path program 1 times [2024-10-14 13:24:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:24:40,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043655954] [2024-10-14 13:24:40,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:24:40,096 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-10-14 13:24:40,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:24:40,097 INFO L229 MonitoredProcess]: Starting monitored process 19 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-10-14 13:24:40,099 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 (19)] Waiting until timeout for monitored process