./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-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-46.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 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:58:03,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:58:03,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:58:03,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:58:03,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:58:03,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:58:03,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:58:03,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:58:03,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:58:03,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:58:03,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:58:03,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:58:03,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:58:03,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:58:03,124 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:58:03,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:58:03,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:58:03,124 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:58:03,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:58:03,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:58:03,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:58:03,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:58:03,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:58:03,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:58:03,126 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:58:03,127 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:58:03,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:58:03,127 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:58:03,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:58:03,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:58:03,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:58:03,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:58:03,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:58:03,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:58:03,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:58:03,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:58:03,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:58:03,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:58:03,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:58:03,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:58:03,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:58:03,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:58:03,136 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 -> 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe [2024-10-13 05:58:03,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:58:03,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:58:03,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:58:03,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:58:03,373 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:58:03,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i [2024-10-13 05:58:04,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:58:04,897 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:58:04,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i [2024-10-13 05:58:04,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66fe0e752/b60fbb9c8c3b46ca889ee75af7e24a6a/FLAG23c32e7f5 [2024-10-13 05:58:04,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66fe0e752/b60fbb9c8c3b46ca889ee75af7e24a6a [2024-10-13 05:58:04,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:58:04,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:58:04,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:58:04,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:58:04,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:58:04,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:58:04" (1/1) ... [2024-10-13 05:58:04,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63769e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:04, skipping insertion in model container [2024-10-13 05:58:04,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:58:04" (1/1) ... [2024-10-13 05:58:04,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:58:05,102 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-46.i[916,929] [2024-10-13 05:58:05,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:58:05,185 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:58:05,196 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-46.i[916,929] [2024-10-13 05:58:05,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:58:05,241 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:58:05,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:05 WrapperNode [2024-10-13 05:58:05,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:58:05,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:58:05,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:58:05,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:58:05,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:05" (1/1) ... [2024-10-13 05:58:05,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:05" (1/1) ... [2024-10-13 05:58:05,299 INFO L138 Inliner]: procedures = 29, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 402 [2024-10-13 05:58:05,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:58:05,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:58:05,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:58:05,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:58:05,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:05" (1/1) ... [2024-10-13 05:58:05,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:05" (1/1) ... [2024-10-13 05:58:05,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:05" (1/1) ... [2024-10-13 05:58:05,345 INFO L175 MemorySlicer]: Split 101 memory accesses to 5 slices as follows [2, 37, 8, 40, 14]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 3, 2]. The 16 writes are split as follows [0, 9, 1, 3, 3]. [2024-10-13 05:58:05,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:05" (1/1) ... [2024-10-13 05:58:05,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:05" (1/1) ... [2024-10-13 05:58:05,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:05" (1/1) ... [2024-10-13 05:58:05,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:05" (1/1) ... [2024-10-13 05:58:05,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:05" (1/1) ... [2024-10-13 05:58:05,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:05" (1/1) ... [2024-10-13 05:58:05,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:58:05,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:58:05,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:58:05,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:58:05,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:05" (1/1) ... [2024-10-13 05:58:05,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:58:05,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:58:05,456 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-13 05:58:05,462 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-13 05:58:05,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:58:05,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 05:58:05,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 05:58:05,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-13 05:58:05,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-13 05:58:05,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-13 05:58:05,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 05:58:05,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 05:58:05,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 05:58:05,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 05:58:05,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 05:58:05,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 05:58:05,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 05:58:05,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-13 05:58:05,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-13 05:58:05,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-13 05:58:05,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 05:58:05,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 05:58:05,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 05:58:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 05:58:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 05:58:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 05:58:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 05:58:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-13 05:58:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-13 05:58:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-13 05:58:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:58:05,508 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:58:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:58:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 05:58:05,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 05:58:05,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 05:58:05,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 05:58:05,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:58:05,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:58:05,623 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:58:05,625 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:58:06,013 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-10-13 05:58:06,014 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:58:06,038 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:58:06,039 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:58:06,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:58:06 BoogieIcfgContainer [2024-10-13 05:58:06,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:58:06,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:58:06,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:58:06,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:58:06,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:58:04" (1/3) ... [2024-10-13 05:58:06,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6551d459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:58:06, skipping insertion in model container [2024-10-13 05:58:06,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:05" (2/3) ... [2024-10-13 05:58:06,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6551d459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:58:06, skipping insertion in model container [2024-10-13 05:58:06,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:58:06" (3/3) ... [2024-10-13 05:58:06,047 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-46.i [2024-10-13 05:58:06,064 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:58:06,064 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:58:06,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:58:06,127 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;@6a8c192, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:58:06,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:58:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:58:06,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 05:58:06,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:06,143 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:06,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:06,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:06,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2041865467, now seen corresponding path program 1 times [2024-10-13 05:58:06,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:58:06,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080544581] [2024-10-13 05:58:06,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:06,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:58:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:06,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:58:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:06,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:58:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:06,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:58:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:06,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:58:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:06,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:58:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:06,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:58:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:06,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:58:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:06,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:58:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:06,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:58:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:06,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:58:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:06,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:58:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:06,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:58:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:06,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:58:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:06,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:58:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:58:06,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:58:06,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080544581] [2024-10-13 05:58:06,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080544581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:06,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:06,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:58:06,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039542050] [2024-10-13 05:58:06,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:06,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:58:06,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:58:06,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:58:06,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:58:06,534 INFO L87 Difference]: Start difference. First operand has 94 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:06,573 INFO L93 Difference]: Finished difference Result 185 states and 292 transitions. [2024-10-13 05:58:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:58:06,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-10-13 05:58:06,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:06,584 INFO L225 Difference]: With dead ends: 185 [2024-10-13 05:58:06,584 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 05:58:06,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-13 05:58:06,592 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:06,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:58:06,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 05:58:06,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-13 05:58:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:58:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2024-10-13 05:58:06,690 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 111 [2024-10-13 05:58:06,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:06,692 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2024-10-13 05:58:06,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2024-10-13 05:58:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 05:58:06,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:06,697 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:06,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:58:06,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:06,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:06,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1023704969, now seen corresponding path program 1 times [2024-10-13 05:58:06,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:58:06,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962243866] [2024-10-13 05:58:06,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:06,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:58:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:07,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:58:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:07,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:58:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:07,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:58:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:07,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:58:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:07,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:58:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:07,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:58:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:07,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:58:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:07,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:58:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:07,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:58:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:07,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:58:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:07,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:58:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:07,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:58:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:07,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:58:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:07,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:58:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:58:07,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:58:07,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962243866] [2024-10-13 05:58:07,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962243866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:07,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:07,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 05:58:07,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901862993] [2024-10-13 05:58:07,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:07,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 05:58:07,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:58:07,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 05:58:07,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:58:07,594 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:08,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:08,024 INFO L93 Difference]: Finished difference Result 353 states and 518 transitions. [2024-10-13 05:58:08,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:58:08,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-10-13 05:58:08,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:08,027 INFO L225 Difference]: With dead ends: 353 [2024-10-13 05:58:08,027 INFO L226 Difference]: Without dead ends: 262 [2024-10-13 05:58:08,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-10-13 05:58:08,029 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 279 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:08,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 729 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:58:08,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-13 05:58:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 255. [2024-10-13 05:58:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 214 states have (on average 1.411214953271028) internal successors, (302), 215 states have internal predecessors, (302), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-13 05:58:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 376 transitions. [2024-10-13 05:58:08,075 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 376 transitions. Word has length 111 [2024-10-13 05:58:08,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:08,078 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 376 transitions. [2024-10-13 05:58:08,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 376 transitions. [2024-10-13 05:58:08,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 05:58:08,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:08,080 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:08,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:58:08,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:08,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:08,081 INFO L85 PathProgramCache]: Analyzing trace with hash -765539531, now seen corresponding path program 1 times [2024-10-13 05:58:08,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:58:08,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740470689] [2024-10-13 05:58:08,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:08,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:58:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:08,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:58:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:08,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:58:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:08,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:58:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:08,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:58:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:08,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:58:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:08,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:58:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:08,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:58:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:08,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:58:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:08,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:58:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:08,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:58:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:08,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:58:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:08,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:58:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:08,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:58:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:08,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:58:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:58:08,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:58:08,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740470689] [2024-10-13 05:58:08,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740470689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:08,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:08,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:58:08,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297584824] [2024-10-13 05:58:08,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:08,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:58:08,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:58:08,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:58:08,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:58:08,431 INFO L87 Difference]: Start difference. First operand 255 states and 376 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:08,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:08,568 INFO L93 Difference]: Finished difference Result 769 states and 1135 transitions. [2024-10-13 05:58:08,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:58:08,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-10-13 05:58:08,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:08,573 INFO L225 Difference]: With dead ends: 769 [2024-10-13 05:58:08,574 INFO L226 Difference]: Without dead ends: 515 [2024-10-13 05:58:08,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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-13 05:58:08,576 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 120 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:08,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 500 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:58:08,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-13 05:58:08,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 291. [2024-10-13 05:58:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 250 states have (on average 1.404) internal successors, (351), 251 states have internal predecessors, (351), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-13 05:58:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2024-10-13 05:58:08,626 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 425 transitions. Word has length 111 [2024-10-13 05:58:08,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:08,627 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 425 transitions. [2024-10-13 05:58:08,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2024-10-13 05:58:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 05:58:08,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:08,632 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:08,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:58:08,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:08,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:08,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1293635306, now seen corresponding path program 1 times [2024-10-13 05:58:08,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:58:08,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306926809] [2024-10-13 05:58:08,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:08,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:58:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 05:58:08,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1066412736] [2024-10-13 05:58:08,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:08,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:58:08,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:58:08,726 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-13 05:58:08,727 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-13 05:58:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:08,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 05:58:08,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:09,051 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 29 treesize of output 13 [2024-10-13 05:58:09,084 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 29 treesize of output 13 [2024-10-13 05:58:09,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:09,519 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 92 treesize of output 36 [2024-10-13 05:58:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:58:14,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:14,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:58:14,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306926809] [2024-10-13 05:58:14,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 05:58:14,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066412736] [2024-10-13 05:58:14,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066412736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:14,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:14,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:58:14,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241639762] [2024-10-13 05:58:14,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:14,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:58:14,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:58:14,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:58:14,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=44, Unknown=5, NotChecked=0, Total=72 [2024-10-13 05:58:14,336 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:22,344 INFO L93 Difference]: Finished difference Result 752 states and 1090 transitions. [2024-10-13 05:58:22,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:58:22,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-10-13 05:58:22,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:22,353 INFO L225 Difference]: With dead ends: 752 [2024-10-13 05:58:22,353 INFO L226 Difference]: Without dead ends: 462 [2024-10-13 05:58:22,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=29, Invalid=56, Unknown=5, NotChecked=0, Total=90 [2024-10-13 05:58:22,355 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 204 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 1 mSolverCounterUnsat, 104 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 104 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:22,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 811 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 434 Invalid, 104 Unknown, 0 Unchecked, 7.4s Time] [2024-10-13 05:58:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-13 05:58:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 319. [2024-10-13 05:58:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 278 states have (on average 1.3992805755395683) internal successors, (389), 279 states have internal predecessors, (389), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-13 05:58:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 463 transitions. [2024-10-13 05:58:22,379 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 463 transitions. Word has length 113 [2024-10-13 05:58:22,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:22,379 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 463 transitions. [2024-10-13 05:58:22,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 463 transitions. [2024-10-13 05:58:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 05:58:22,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:22,381 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:22,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 05:58:22,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:58:22,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:22,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash 282518056, now seen corresponding path program 1 times [2024-10-13 05:58:22,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:58:22,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276465779] [2024-10-13 05:58:22,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:22,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:58:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:24,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:58:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:24,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:58:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:24,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:58:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:24,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:58:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:24,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:58:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:24,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:58:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:24,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:58:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:24,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:58:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:24,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:58:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:24,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:58:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:24,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:58:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:24,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:58:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:24,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:58:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:24,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:58:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:58:24,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:58:24,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276465779] [2024-10-13 05:58:24,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276465779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:24,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:24,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:58:24,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22944825] [2024-10-13 05:58:24,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:24,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:58:24,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:58:24,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:58:24,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:58:24,131 INFO L87 Difference]: Start difference. First operand 319 states and 463 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:29,918 INFO L93 Difference]: Finished difference Result 709 states and 1025 transitions. [2024-10-13 05:58:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:58:29,919 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-10-13 05:58:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:29,921 INFO L225 Difference]: With dead ends: 709 [2024-10-13 05:58:29,921 INFO L226 Difference]: Without dead ends: 387 [2024-10-13 05:58:29,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:58:29,922 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 254 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:29,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 686 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-10-13 05:58:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-13 05:58:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 319. [2024-10-13 05:58:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 278 states have (on average 1.3920863309352518) internal successors, (387), 279 states have internal predecessors, (387), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-13 05:58:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 461 transitions. [2024-10-13 05:58:29,937 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 461 transitions. Word has length 113 [2024-10-13 05:58:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:29,938 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 461 transitions. [2024-10-13 05:58:29,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 461 transitions. [2024-10-13 05:58:29,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 05:58:29,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:29,939 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:29,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 05:58:29,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:29,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:29,940 INFO L85 PathProgramCache]: Analyzing trace with hash 846172300, now seen corresponding path program 1 times [2024-10-13 05:58:29,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:58:29,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350000711] [2024-10-13 05:58:29,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:29,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:58:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 05:58:29,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1675477154] [2024-10-13 05:58:29,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:29,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:58:29,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:58:29,995 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:58:29,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 05:58:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:58:30,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:58:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:58:30,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:58:30,484 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:58:30,485 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:58:30,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 05:58:30,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 05:58:30,690 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 05:58:30,751 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:58:30,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:58:30 BoogieIcfgContainer [2024-10-13 05:58:30,753 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:58:30,754 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:58:30,754 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:58:30,754 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:58:30,754 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:58:06" (3/4) ... [2024-10-13 05:58:30,756 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:58:30,757 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:58:30,758 INFO L158 Benchmark]: Toolchain (without parser) took 25833.50ms. Allocated memory was 151.0MB in the beginning and 255.9MB in the end (delta: 104.9MB). Free memory was 78.7MB in the beginning and 136.8MB in the end (delta: -58.2MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2024-10-13 05:58:30,758 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 101.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:58:30,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.23ms. Allocated memory is still 151.0MB. Free memory was 78.7MB in the beginning and 63.1MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 05:58:30,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.56ms. Allocated memory is still 151.0MB. Free memory was 63.1MB in the beginning and 59.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:58:30,758 INFO L158 Benchmark]: Boogie Preprocessor took 111.71ms. Allocated memory is still 151.0MB. Free memory was 59.6MB in the beginning and 118.5MB in the end (delta: -58.9MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-10-13 05:58:30,758 INFO L158 Benchmark]: RCFGBuilder took 627.48ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 118.4MB in the beginning and 146.9MB in the end (delta: -28.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-13 05:58:30,759 INFO L158 Benchmark]: TraceAbstraction took 24712.23ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 146.9MB in the beginning and 136.8MB in the end (delta: 10.0MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2024-10-13 05:58:30,759 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 255.9MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:58:30,760 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.17ms. Allocated memory is still 151.0MB. Free memory is still 101.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.23ms. Allocated memory is still 151.0MB. Free memory was 78.7MB in the beginning and 63.1MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.56ms. Allocated memory is still 151.0MB. Free memory was 63.1MB in the beginning and 59.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.71ms. Allocated memory is still 151.0MB. Free memory was 59.6MB in the beginning and 118.5MB in the end (delta: -58.9MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * RCFGBuilder took 627.48ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 118.4MB in the beginning and 146.9MB in the end (delta: -28.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24712.23ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 146.9MB in the beginning and 136.8MB in the end (delta: 10.0MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 255.9MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L25-L27] double double_Array_0[1] = { 31.75 }; [L25-L27] double double_Array_0[1] = { 31.75 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L34] unsigned char last_1_BOOL_unsigned_char_Array_0_4_ = 1; [L35] signed short int last_1_signed_short_int_Array_0_1_ = -4; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] EXPR BOOL_unsigned_char_Array_0[4] [L97] last_1_BOOL_unsigned_char_Array_0_4_ = BOOL_unsigned_char_Array_0[4] [L98] EXPR signed_short_int_Array_0[1] [L98] last_1_signed_short_int_Array_0_1_ = signed_short_int_Array_0[1] [L108] RET updateLastVariables() [L109] 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}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L78] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L80] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L81] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] double_Array_0[0] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[0] [L84] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L84] EXPR double_Array_0[0] [L84] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L88] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[2] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[2] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(signed_char_Array_0[2] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(signed_char_Array_0[2] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L92] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L93] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L109] RET updateVariables() [L110] CALL step() [L39] EXPR signed_short_int_Array_0[0] [L39] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L39] COND FALSE !(last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) [L44] EXPR signed_char_Array_0[2] [L44] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L44] EXPR ((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]) [L44] EXPR signed_char_Array_0[2] [L44] EXPR ((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L44] signed long int stepLocal_1 = (((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0])); [L45] EXPR signed_char_Array_0[0] [L45] EXPR signed_char_Array_0[2] [L45] signed long int stepLocal_0 = signed_char_Array_0[0] / signed_char_Array_0[2]; [L46] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L46] COND TRUE (- double_Array_0[0]) >= 16.75 [L47] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L47] COND TRUE stepLocal_0 >= signed_char_Array_0[0] [L48] COND TRUE stepLocal_1 > -32 [L49] BOOL_unsigned_char_Array_0[4] = 0 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L63] EXPR signed_char_Array_0[0] [L63] signed char stepLocal_2 = signed_char_Array_0[0]; [L64] EXPR signed_char_Array_0[0] [L64] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L64] EXPR signed_char_Array_0[0] | signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_2=-25] [L64] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L64] COND TRUE ((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < stepLocal_2 [L65] EXPR signed_short_int_Array_0[0] [L65] signed_short_int_Array_0[1] = (signed_short_int_Array_0[0] - 256) [L69] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L69] COND FALSE !(1 == signed_char_Array_0[2]) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) [L101] EXPR BOOL_unsigned_char_Array_0[4] [L101] EXPR ((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101-L102] return (((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) : 1) : 1) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.6s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 104 mSolverCounterUnknown, 857 SdHoareTripleChecker+Valid, 12.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 857 mSDsluCounter, 2857 SdHoareTripleChecker+Invalid, 12.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2192 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1348 IncrementalHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 665 mSDtfsCounter, 1348 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred in iteration=4, InterpolantAutomatonStates: 33, 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, 5 MinimizatonAttempts, 442 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 898 NumberOfCodeBlocks, 898 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 554 ConstructedInterpolants, 1 QuantifiedInterpolants, 2947 SizeOfPredicates, 3 NumberOfNonLiveVariables, 385 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1820/1820 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-13 05:58:30,972 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-13 05:58:31,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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-46.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 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:58:32,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:58:32,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:58:32,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:58:32,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:58:32,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:58:32,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:58:32,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:58:32,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:58:32,898 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:58:32,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:58:32,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:58:32,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:58:32,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:58:32,899 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:58:32,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:58:32,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:58:32,900 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:58:32,900 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:58:32,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:58:32,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:58:32,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:58:32,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:58:32,904 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:58:32,904 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:58:32,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:58:32,904 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:58:32,904 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:58:32,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:58:32,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:58:32,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:58:32,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:58:32,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:58:32,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:58:32,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:58:32,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:58:32,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:58:32,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:58:32,907 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:58:32,907 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:58:32,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:58:32,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:58:32,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:58:32,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:58:32,909 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:58:32,909 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 -> 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe [2024-10-13 05:58:33,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:58:33,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:58:33,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:58:33,200 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:58:33,201 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:58:33,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i [2024-10-13 05:58:34,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:58:34,705 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:58:34,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i [2024-10-13 05:58:34,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a8e5f079/46b6ec2f25f84d17a038bf292ae31226/FLAG743e2a1a2 [2024-10-13 05:58:35,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a8e5f079/46b6ec2f25f84d17a038bf292ae31226 [2024-10-13 05:58:35,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:58:35,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:58:35,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:58:35,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:58:35,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:58:35,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:58:35" (1/1) ... [2024-10-13 05:58:35,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c161dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:35, skipping insertion in model container [2024-10-13 05:58:35,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:58:35" (1/1) ... [2024-10-13 05:58:35,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:58:35,269 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-46.i[916,929] [2024-10-13 05:58:35,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:58:35,328 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:58:35,337 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-46.i[916,929] [2024-10-13 05:58:35,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:58:35,414 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:58:35,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:35 WrapperNode [2024-10-13 05:58:35,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:58:35,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:58:35,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:58:35,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:58:35,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:35" (1/1) ... [2024-10-13 05:58:35,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:35" (1/1) ... [2024-10-13 05:58:35,482 INFO L138 Inliner]: procedures = 33, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 381 [2024-10-13 05:58:35,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:58:35,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:58:35,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:58:35,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:58:35,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:35" (1/1) ... [2024-10-13 05:58:35,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:35" (1/1) ... [2024-10-13 05:58:35,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:35" (1/1) ... [2024-10-13 05:58:35,540 INFO L175 MemorySlicer]: Split 101 memory accesses to 5 slices as follows [2, 37, 8, 40, 14]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 3, 2]. The 16 writes are split as follows [0, 9, 1, 3, 3]. [2024-10-13 05:58:35,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:35" (1/1) ... [2024-10-13 05:58:35,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:35" (1/1) ... [2024-10-13 05:58:35,565 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:35" (1/1) ... [2024-10-13 05:58:35,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:35" (1/1) ... [2024-10-13 05:58:35,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:35" (1/1) ... [2024-10-13 05:58:35,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:35" (1/1) ... [2024-10-13 05:58:35,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:58:35,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:58:35,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:58:35,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:58:35,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:35" (1/1) ... [2024-10-13 05:58:35,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:58:35,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:58:35,624 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-13 05:58:35,627 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-13 05:58:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:58:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-13 05:58:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-13 05:58:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-13 05:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-13 05:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-13 05:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-13 05:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-13 05:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-13 05:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-13 05:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-13 05:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 05:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 05:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 05:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-13 05:58:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-13 05:58:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 05:58:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 05:58:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-13 05:58:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-13 05:58:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-13 05:58:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:58:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 05:58:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 05:58:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-13 05:58:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-13 05:58:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-13 05:58:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-13 05:58:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-13 05:58:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-13 05:58:35,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-13 05:58:35,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 05:58:35,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 05:58:35,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-13 05:58:35,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-13 05:58:35,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-13 05:58:35,675 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:58:35,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:58:35,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:58:35,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:58:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 05:58:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 05:58:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-13 05:58:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-13 05:58:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-13 05:58:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 05:58:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 05:58:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-13 05:58:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-13 05:58:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-13 05:58:35,799 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:58:35,801 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:58:36,387 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-10-13 05:58:36,387 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:58:36,415 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:58:36,415 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:58:36,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:58:36 BoogieIcfgContainer [2024-10-13 05:58:36,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:58:36,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:58:36,417 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:58:36,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:58:36,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:58:35" (1/3) ... [2024-10-13 05:58:36,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5536f5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:58:36, skipping insertion in model container [2024-10-13 05:58:36,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:35" (2/3) ... [2024-10-13 05:58:36,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5536f5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:58:36, skipping insertion in model container [2024-10-13 05:58:36,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:58:36" (3/3) ... [2024-10-13 05:58:36,422 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-46.i [2024-10-13 05:58:36,435 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:58:36,436 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:58:36,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:58:36,493 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;@4b4380cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:58:36,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:58:36,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 70 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:58:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 05:58:36,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:36,510 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:36,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:36,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash 309420061, now seen corresponding path program 1 times [2024-10-13 05:58:36,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:36,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106401283] [2024-10-13 05:58:36,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:36,527 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-13 05:58:36,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:36,530 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-13 05:58:36,531 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-13 05:58:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:36,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:58:36,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-10-13 05:58:36,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:36,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:36,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106401283] [2024-10-13 05:58:36,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106401283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:36,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:36,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:58:36,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995745100] [2024-10-13 05:58:36,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:36,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:58:36,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:36,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:58:36,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:58:36,827 INFO L87 Difference]: Start difference. First operand has 86 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 70 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:36,880 INFO L93 Difference]: Finished difference Result 169 states and 268 transitions. [2024-10-13 05:58:36,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:58:36,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2024-10-13 05:58:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:36,890 INFO L225 Difference]: With dead ends: 169 [2024-10-13 05:58:36,891 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 05:58:36,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 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-13 05:58:36,899 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:36,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:58:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 05:58:36,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 05:58:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:58:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2024-10-13 05:58:36,946 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 109 [2024-10-13 05:58:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:36,947 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2024-10-13 05:58:36,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2024-10-13 05:58:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 05:58:36,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:36,951 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:36,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 05:58:37,155 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-13 05:58:37,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:37,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1602147687, now seen corresponding path program 1 times [2024-10-13 05:58:37,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:37,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136518358] [2024-10-13 05:58:37,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:37,158 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-13 05:58:37,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:37,161 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-13 05:58:37,162 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-13 05:58:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:37,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 05:58:37,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:37,483 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 21 treesize of output 9 [2024-10-13 05:58:38,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-13 05:58:39,287 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 30 treesize of output 18 [2024-10-13 05:58:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 127 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-13 05:58:39,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:58:41,407 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-13 05:58:41,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:41,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136518358] [2024-10-13 05:58:41,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136518358] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:58:41,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1914743224] [2024-10-13 05:58:41,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:41,802 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 05:58:41,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 05:58:41,808 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 05:58:41,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-13 05:58:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:42,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 05:58:42,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:42,418 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 21 treesize of output 9 [2024-10-13 05:58:42,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-13 05:58:43,975 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 30 treesize of output 18 [2024-10-13 05:58:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-13 05:58:44,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:58:45,336 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-13 05:58:45,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1914743224] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:58:45,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:58:45,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 17 [2024-10-13 05:58:45,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855085163] [2024-10-13 05:58:45,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:58:45,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 05:58:45,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:45,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 05:58:45,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2024-10-13 05:58:45,497 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand has 18 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-13 05:59:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:03,050 INFO L93 Difference]: Finished difference Result 338 states and 484 transitions. [2024-10-13 05:59:03,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 05:59:03,051 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 109 [2024-10-13 05:59:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:03,054 INFO L225 Difference]: With dead ends: 338 [2024-10-13 05:59:03,054 INFO L226 Difference]: Without dead ends: 255 [2024-10-13 05:59:03,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 252 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=641, Invalid=2115, Unknown=0, NotChecked=0, Total=2756 [2024-10-13 05:59:03,060 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 618 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:03,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 972 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2024-10-13 05:59:03,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-13 05:59:03,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 203. [2024-10-13 05:59:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 159 states have (on average 1.3459119496855345) internal successors, (214), 160 states have internal predecessors, (214), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-13 05:59:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 288 transitions. [2024-10-13 05:59:03,088 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 288 transitions. Word has length 109 [2024-10-13 05:59:03,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:03,089 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 288 transitions. [2024-10-13 05:59:03,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-13 05:59:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 288 transitions. [2024-10-13 05:59:03,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 05:59:03,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:03,091 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:59:03,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:03,299 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-13 05:59:03,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-13 05:59:03,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:03,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:03,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1343982249, now seen corresponding path program 1 times [2024-10-13 05:59:03,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:03,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993640842] [2024-10-13 05:59:03,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:03,494 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-13 05:59:03,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:03,495 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-13 05:59:03,496 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-13 05:59:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:03,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 05:59:03,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:03,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-13 05:59:03,703 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 43 treesize of output 25 [2024-10-13 05:59:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:03,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:03,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:03,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993640842] [2024-10-13 05:59:03,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993640842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:03,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:03,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:59:03,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569530914] [2024-10-13 05:59:03,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:03,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:59:03,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:03,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:59:03,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:59:03,724 INFO L87 Difference]: Start difference. First operand 203 states and 288 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:04,044 INFO L93 Difference]: Finished difference Result 472 states and 680 transitions. [2024-10-13 05:59:04,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:59:04,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2024-10-13 05:59:04,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:04,047 INFO L225 Difference]: With dead ends: 472 [2024-10-13 05:59:04,048 INFO L226 Difference]: Without dead ends: 349 [2024-10-13 05:59:04,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 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-13 05:59:04,049 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 110 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:04,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 434 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:59:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-13 05:59:04,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 219. [2024-10-13 05:59:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 175 states have (on average 1.3428571428571427) internal successors, (235), 176 states have internal predecessors, (235), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-13 05:59:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 309 transitions. [2024-10-13 05:59:04,074 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 309 transitions. Word has length 109 [2024-10-13 05:59:04,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:04,074 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 309 transitions. [2024-10-13 05:59:04,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:04,074 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 309 transitions. [2024-10-13 05:59:04,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 05:59:04,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:04,076 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:59:04,086 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-13 05:59:04,279 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-13 05:59:04,280 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:04,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash -314329396, now seen corresponding path program 1 times [2024-10-13 05:59:04,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:04,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900853148] [2024-10-13 05:59:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:04,281 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-13 05:59:04,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:04,282 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-13 05:59:04,283 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-13 05:59:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:04,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 05:59:04,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:06,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:06,123 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 144 treesize of output 54 [2024-10-13 05:59:06,213 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-13 05:59:06,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:06,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:06,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900853148] [2024-10-13 05:59:06,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900853148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:06,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:06,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:59:06,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147625256] [2024-10-13 05:59:06,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:06,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 05:59:06,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:06,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 05:59:06,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:59:06,216 INFO L87 Difference]: Start difference. First operand 219 states and 309 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:59:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:07,805 INFO L93 Difference]: Finished difference Result 652 states and 921 transitions. [2024-10-13 05:59:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 05:59:07,806 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-10-13 05:59:07,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:07,809 INFO L225 Difference]: With dead ends: 652 [2024-10-13 05:59:07,809 INFO L226 Difference]: Without dead ends: 515 [2024-10-13 05:59:07,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:59:07,811 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 252 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:07,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1017 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 05:59:07,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-13 05:59:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 495. [2024-10-13 05:59:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 400 states have (on average 1.345) internal successors, (538), 406 states have internal predecessors, (538), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 05:59:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 698 transitions. [2024-10-13 05:59:07,853 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 698 transitions. Word has length 111 [2024-10-13 05:59:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:07,853 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 698 transitions. [2024-10-13 05:59:07,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:59:07,854 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 698 transitions. [2024-10-13 05:59:07,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 05:59:07,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:07,855 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:59:07,867 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-13 05:59:08,055 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-13 05:59:08,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:08,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:08,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2056572836, now seen corresponding path program 1 times [2024-10-13 05:59:08,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:08,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290895611] [2024-10-13 05:59:08,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:08,057 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-13 05:59:08,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:08,059 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-13 05:59:08,060 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-13 05:59:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:08,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 05:59:08,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:08,250 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 11 [2024-10-13 05:59:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:08,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:08,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:08,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290895611] [2024-10-13 05:59:08,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290895611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:08,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:08,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:59:08,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066913717] [2024-10-13 05:59:08,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:08,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:59:08,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:08,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:59:08,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:59:08,350 INFO L87 Difference]: Start difference. First operand 495 states and 698 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:10,557 INFO L93 Difference]: Finished difference Result 981 states and 1393 transitions. [2024-10-13 05:59:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:59:10,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-10-13 05:59:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:10,561 INFO L225 Difference]: With dead ends: 981 [2024-10-13 05:59:10,561 INFO L226 Difference]: Without dead ends: 655 [2024-10-13 05:59:10,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 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-13 05:59:10,563 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 76 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:10,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 380 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 05:59:10,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-10-13 05:59:10,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 495. [2024-10-13 05:59:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 400 states have (on average 1.3375) internal successors, (535), 406 states have internal predecessors, (535), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 05:59:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 695 transitions. [2024-10-13 05:59:10,596 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 695 transitions. Word has length 111 [2024-10-13 05:59:10,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:10,596 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 695 transitions. [2024-10-13 05:59:10,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 695 transitions. [2024-10-13 05:59:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 05:59:10,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:10,598 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:59:10,607 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-13 05:59:10,798 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-13 05:59:10,799 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:10,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:10,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1376514466, now seen corresponding path program 1 times [2024-10-13 05:59:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:10,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262213578] [2024-10-13 05:59:10,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:10,800 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-13 05:59:10,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:10,802 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-13 05:59:10,803 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-13 05:59:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:10,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 05:59:10,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:10,989 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:10,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:10,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:10,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262213578] [2024-10-13 05:59:10,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262213578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:10,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:10,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:59:10,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603686348] [2024-10-13 05:59:10,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:10,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:59:10,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:10,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:59:10,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:59:10,991 INFO L87 Difference]: Start difference. First operand 495 states and 695 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:11,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:11,072 INFO L93 Difference]: Finished difference Result 884 states and 1254 transitions. [2024-10-13 05:59:11,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:59:11,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-10-13 05:59:11,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:11,076 INFO L225 Difference]: With dead ends: 884 [2024-10-13 05:59:11,076 INFO L226 Difference]: Without dead ends: 510 [2024-10-13 05:59:11,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 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-13 05:59:11,077 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:11,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 453 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:59:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-13 05:59:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2024-10-13 05:59:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 415 states have (on average 1.3253012048192772) internal successors, (550), 421 states have internal predecessors, (550), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 05:59:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 710 transitions. [2024-10-13 05:59:11,109 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 710 transitions. Word has length 111 [2024-10-13 05:59:11,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:11,110 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 710 transitions. [2024-10-13 05:59:11,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 710 transitions. [2024-10-13 05:59:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 05:59:11,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:11,112 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:59:11,120 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 (8)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:11,312 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-13 05:59:11,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:11,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:11,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2069595342, now seen corresponding path program 1 times [2024-10-13 05:59:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:11,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335803009] [2024-10-13 05:59:11,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:11,314 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-13 05:59:11,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:11,315 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-13 05:59:11,316 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-13 05:59:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:11,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 05:59:11,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-13 05:59:11,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:11,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:11,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335803009] [2024-10-13 05:59:11,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335803009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:11,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:11,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:59:11,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650460136] [2024-10-13 05:59:11,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:11,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:59:11,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:11,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:59:11,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:59:11,475 INFO L87 Difference]: Start difference. First operand 510 states and 710 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:59:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:11,546 INFO L93 Difference]: Finished difference Result 949 states and 1326 transitions. [2024-10-13 05:59:11,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:59:11,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-10-13 05:59:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:11,549 INFO L225 Difference]: With dead ends: 949 [2024-10-13 05:59:11,549 INFO L226 Difference]: Without dead ends: 510 [2024-10-13 05:59:11,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 108 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-13 05:59:11,551 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:11,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:59:11,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-13 05:59:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2024-10-13 05:59:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 415 states have (on average 1.3180722891566266) internal successors, (547), 421 states have internal predecessors, (547), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 05:59:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 707 transitions. [2024-10-13 05:59:11,583 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 707 transitions. Word has length 111 [2024-10-13 05:59:11,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:11,584 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 707 transitions. [2024-10-13 05:59:11,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:59:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 707 transitions. [2024-10-13 05:59:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 05:59:11,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:11,586 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:59:11,595 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-13 05:59:11,786 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-13 05:59:11,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:11,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:11,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1945679183, now seen corresponding path program 1 times [2024-10-13 05:59:11,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:11,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492341634] [2024-10-13 05:59:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:11,787 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-13 05:59:11,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:11,789 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-13 05:59:11,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 (10)] Waiting until timeout for monitored process [2024-10-13 05:59:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:11,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 05:59:11,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:11,954 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 21 treesize of output 9 [2024-10-13 05:59:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:12,090 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:12,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:12,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492341634] [2024-10-13 05:59:12,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492341634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:12,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:12,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:59:12,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985774210] [2024-10-13 05:59:12,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:12,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:59:12,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:12,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:59:12,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:59:12,091 INFO L87 Difference]: Start difference. First operand 510 states and 707 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:12,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:12,416 INFO L93 Difference]: Finished difference Result 1526 states and 2138 transitions. [2024-10-13 05:59:12,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:59:12,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2024-10-13 05:59:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:12,422 INFO L225 Difference]: With dead ends: 1526 [2024-10-13 05:59:12,422 INFO L226 Difference]: Without dead ends: 1137 [2024-10-13 05:59:12,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:59:12,424 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 249 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:12,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 297 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:59:12,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2024-10-13 05:59:12,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1071. [2024-10-13 05:59:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 924 states have (on average 1.352813852813853) internal successors, (1250), 934 states have internal predecessors, (1250), 126 states have call successors, (126), 20 states have call predecessors, (126), 20 states have return successors, (126), 116 states have call predecessors, (126), 126 states have call successors, (126) [2024-10-13 05:59:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1502 transitions. [2024-10-13 05:59:12,478 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1502 transitions. Word has length 112 [2024-10-13 05:59:12,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:12,478 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1502 transitions. [2024-10-13 05:59:12,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1502 transitions. [2024-10-13 05:59:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 05:59:12,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:12,480 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:59:12,488 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-13 05:59:12,680 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-13 05:59:12,680 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:12,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:12,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2130433395, now seen corresponding path program 1 times [2024-10-13 05:59:12,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:12,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243271094] [2024-10-13 05:59:12,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:12,682 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-13 05:59:12,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:12,684 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-13 05:59:12,685 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-13 05:59:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:12,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 05:59:12,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:12,925 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-13 05:59:13,031 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 38 treesize of output 18 [2024-10-13 05:59:13,090 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 38 treesize of output 18 [2024-10-13 05:59:13,426 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 38 treesize of output 18 [2024-10-13 05:59:13,453 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 38 treesize of output 29 [2024-10-13 05:59:13,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:13,559 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 78 treesize of output 40 [2024-10-13 05:59:13,621 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 28 proven. 72 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:59:13,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:59:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:13,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:13,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243271094] [2024-10-13 05:59:13,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243271094] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:59:13,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:59:13,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 16 [2024-10-13 05:59:13,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378480584] [2024-10-13 05:59:13,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:13,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:59:13,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:13,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:59:13,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-13 05:59:13,762 INFO L87 Difference]: Start difference. First operand 1071 states and 1502 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:14,123 INFO L93 Difference]: Finished difference Result 2039 states and 2874 transitions. [2024-10-13 05:59:14,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:59:14,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2024-10-13 05:59:14,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:14,129 INFO L225 Difference]: With dead ends: 2039 [2024-10-13 05:59:14,129 INFO L226 Difference]: Without dead ends: 1093 [2024-10-13 05:59:14,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-10-13 05:59:14,132 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 41 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:14,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 654 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:59:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2024-10-13 05:59:14,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1061. [2024-10-13 05:59:14,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 914 states have (on average 1.3566739606126914) internal successors, (1240), 924 states have internal predecessors, (1240), 126 states have call successors, (126), 20 states have call predecessors, (126), 20 states have return successors, (126), 116 states have call predecessors, (126), 126 states have call successors, (126) [2024-10-13 05:59:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1492 transitions. [2024-10-13 05:59:14,184 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1492 transitions. Word has length 112 [2024-10-13 05:59:14,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:14,184 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1492 transitions. [2024-10-13 05:59:14,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:14,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1492 transitions. [2024-10-13 05:59:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 05:59:14,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:14,186 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:59:14,194 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-13 05:59:14,386 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-13 05:59:14,387 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:14,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2016083421, now seen corresponding path program 1 times [2024-10-13 05:59:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:14,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986043242] [2024-10-13 05:59:14,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:14,388 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-13 05:59:14,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:14,389 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-13 05:59:14,390 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-13 05:59:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:14,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 05:59:14,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:14,668 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 21 treesize of output 9 [2024-10-13 05:59:15,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-13 05:59:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 127 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-13 05:59:17,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:59:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:17,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:17,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986043242] [2024-10-13 05:59:17,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986043242] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:59:17,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:59:17,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2024-10-13 05:59:17,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069127438] [2024-10-13 05:59:17,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:17,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:59:17,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:17,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:59:17,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-10-13 05:59:17,978 INFO L87 Difference]: Start difference. First operand 1061 states and 1492 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:18,453 INFO L93 Difference]: Finished difference Result 2839 states and 4000 transitions. [2024-10-13 05:59:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:59:18,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-10-13 05:59:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:18,461 INFO L225 Difference]: With dead ends: 2839 [2024-10-13 05:59:18,461 INFO L226 Difference]: Without dead ends: 1903 [2024-10-13 05:59:18,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-10-13 05:59:18,464 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 73 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:18,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 473 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:59:18,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2024-10-13 05:59:18,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1447. [2024-10-13 05:59:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1300 states have (on average 1.3753846153846154) internal successors, (1788), 1310 states have internal predecessors, (1788), 126 states have call successors, (126), 20 states have call predecessors, (126), 20 states have return successors, (126), 116 states have call predecessors, (126), 126 states have call successors, (126) [2024-10-13 05:59:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2040 transitions. [2024-10-13 05:59:18,530 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2040 transitions. Word has length 113 [2024-10-13 05:59:18,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:18,530 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 2040 transitions. [2024-10-13 05:59:18,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2040 transitions. [2024-10-13 05:59:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 05:59:18,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:18,533 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:59:18,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:18,734 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-13 05:59:18,734 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:18,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:18,734 INFO L85 PathProgramCache]: Analyzing trace with hash -241076059, now seen corresponding path program 1 times [2024-10-13 05:59:18,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:18,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8519145] [2024-10-13 05:59:18,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:18,735 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-13 05:59:18,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:18,738 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-13 05:59:18,739 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-13 05:59:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:18,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 05:59:18,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:18,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-13 05:59:18,961 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 43 treesize of output 25 [2024-10-13 05:59:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:18,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:18,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:18,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8519145] [2024-10-13 05:59:18,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8519145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:18,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:18,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:59:18,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477751971] [2024-10-13 05:59:18,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:18,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:59:18,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:18,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:59:18,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:59:18,988 INFO L87 Difference]: Start difference. First operand 1447 states and 2040 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:19,201 INFO L93 Difference]: Finished difference Result 3100 states and 4387 transitions. [2024-10-13 05:59:19,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:59:19,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-10-13 05:59:19,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:19,209 INFO L225 Difference]: With dead ends: 3100 [2024-10-13 05:59:19,209 INFO L226 Difference]: Without dead ends: 1788 [2024-10-13 05:59:19,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:59:19,212 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 110 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:19,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 839 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:59:19,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2024-10-13 05:59:19,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1718. [2024-10-13 05:59:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1499 states have (on average 1.3495663775850566) internal successors, (2023), 1516 states have internal predecessors, (2023), 188 states have call successors, (188), 30 states have call predecessors, (188), 30 states have return successors, (188), 171 states have call predecessors, (188), 188 states have call successors, (188) [2024-10-13 05:59:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2399 transitions. [2024-10-13 05:59:19,285 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2399 transitions. Word has length 113 [2024-10-13 05:59:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:19,293 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 2399 transitions. [2024-10-13 05:59:19,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2399 transitions. [2024-10-13 05:59:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 05:59:19,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:19,296 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:59:19,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 05:59:19,496 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-13 05:59:19,496 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:19,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:19,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1716671094, now seen corresponding path program 1 times [2024-10-13 05:59:19,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:19,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125334594] [2024-10-13 05:59:19,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:19,497 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-13 05:59:19,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:19,498 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-13 05:59:19,499 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-13 05:59:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:19,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 05:59:19,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:19,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-13 05:59:19,713 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 43 treesize of output 25 [2024-10-13 05:59:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:19,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:19,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:19,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125334594] [2024-10-13 05:59:19,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125334594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:19,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:19,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:59:19,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386080548] [2024-10-13 05:59:19,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:19,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:59:19,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:19,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:59:19,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:59:19,751 INFO L87 Difference]: Start difference. First operand 1718 states and 2399 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:20,144 INFO L93 Difference]: Finished difference Result 3399 states and 4748 transitions. [2024-10-13 05:59:20,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:59:20,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-10-13 05:59:20,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:20,150 INFO L225 Difference]: With dead ends: 3399 [2024-10-13 05:59:20,151 INFO L226 Difference]: Without dead ends: 1816 [2024-10-13 05:59:20,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 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-13 05:59:20,154 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 109 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:20,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 554 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:59:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2024-10-13 05:59:20,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1782. [2024-10-13 05:59:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1563 states have (on average 1.3352527191298784) internal successors, (2087), 1580 states have internal predecessors, (2087), 188 states have call successors, (188), 30 states have call predecessors, (188), 30 states have return successors, (188), 171 states have call predecessors, (188), 188 states have call successors, (188) [2024-10-13 05:59:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2463 transitions. [2024-10-13 05:59:20,234 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2463 transitions. Word has length 113 [2024-10-13 05:59:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:20,235 INFO L471 AbstractCegarLoop]: Abstraction has 1782 states and 2463 transitions. [2024-10-13 05:59:20,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2463 transitions. [2024-10-13 05:59:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 05:59:20,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:20,237 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:59:20,246 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-13 05:59:20,438 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-13 05:59:20,439 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:20,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:20,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1974836532, now seen corresponding path program 1 times [2024-10-13 05:59:20,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:20,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683811589] [2024-10-13 05:59:20,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:20,439 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-13 05:59:20,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:20,441 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-13 05:59:20,441 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-13 05:59:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:20,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 05:59:20,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:21,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:21,930 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 145 treesize of output 55 [2024-10-13 05:59:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-13 05:59:22,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:22,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:22,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683811589] [2024-10-13 05:59:22,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683811589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:22,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:22,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:59:22,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022601928] [2024-10-13 05:59:22,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:22,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 05:59:22,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:22,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 05:59:22,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:59:22,017 INFO L87 Difference]: Start difference. First operand 1782 states and 2463 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:59:23,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:23,341 INFO L93 Difference]: Finished difference Result 3334 states and 4599 transitions. [2024-10-13 05:59:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 05:59:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2024-10-13 05:59:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:23,348 INFO L225 Difference]: With dead ends: 3334 [2024-10-13 05:59:23,349 INFO L226 Difference]: Without dead ends: 1687 [2024-10-13 05:59:23,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:59:23,352 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 230 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:23,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 723 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 05:59:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2024-10-13 05:59:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1533. [2024-10-13 05:59:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1332 states have (on average 1.3273273273273274) internal successors, (1768), 1346 states have internal predecessors, (1768), 170 states have call successors, (170), 30 states have call predecessors, (170), 30 states have return successors, (170), 156 states have call predecessors, (170), 170 states have call successors, (170) [2024-10-13 05:59:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2108 transitions. [2024-10-13 05:59:23,420 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2108 transitions. Word has length 113 [2024-10-13 05:59:23,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:23,420 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 2108 transitions. [2024-10-13 05:59:23,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:59:23,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2108 transitions. [2024-10-13 05:59:23,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 05:59:23,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:23,422 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:59:23,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:23,623 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-13 05:59:23,623 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:23,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:23,624 INFO L85 PathProgramCache]: Analyzing trace with hash -21938715, now seen corresponding path program 1 times [2024-10-13 05:59:23,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:23,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87445089] [2024-10-13 05:59:23,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:23,624 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-13 05:59:23,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:23,625 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-13 05:59:23,626 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-13 05:59:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:23,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 05:59:23,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:23,894 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-13 05:59:23,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2024-10-13 05:59:23,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:23,954 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 72 treesize of output 42 [2024-10-13 05:59:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:23,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:23,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:23,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87445089] [2024-10-13 05:59:23,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87445089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:23,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:23,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:59:23,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125607644] [2024-10-13 05:59:23,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:23,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:59:23,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:23,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:59:23,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:59:23,991 INFO L87 Difference]: Start difference. First operand 1533 states and 2108 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:24,188 INFO L93 Difference]: Finished difference Result 2997 states and 4122 transitions. [2024-10-13 05:59:24,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:59:24,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-10-13 05:59:24,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:24,195 INFO L225 Difference]: With dead ends: 2997 [2024-10-13 05:59:24,195 INFO L226 Difference]: Without dead ends: 1599 [2024-10-13 05:59:24,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 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-13 05:59:24,198 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 86 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:24,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 887 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:59:24,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2024-10-13 05:59:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1597. [2024-10-13 05:59:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1392 states have (on average 1.3132183908045978) internal successors, (1828), 1406 states have internal predecessors, (1828), 170 states have call successors, (170), 34 states have call predecessors, (170), 34 states have return successors, (170), 156 states have call predecessors, (170), 170 states have call successors, (170) [2024-10-13 05:59:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2168 transitions. [2024-10-13 05:59:24,268 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2168 transitions. Word has length 113 [2024-10-13 05:59:24,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:24,268 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 2168 transitions. [2024-10-13 05:59:24,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2168 transitions. [2024-10-13 05:59:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 05:59:24,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:24,270 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:59:24,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-13 05:59:24,470 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-13 05:59:24,471 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:24,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:24,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1753068647, now seen corresponding path program 1 times [2024-10-13 05:59:24,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:24,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904300898] [2024-10-13 05:59:24,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:24,472 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-13 05:59:24,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:24,473 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-13 05:59:24,473 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-13 05:59:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:24,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 05:59:24,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:24,714 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 21 treesize of output 9 [2024-10-13 05:59:25,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-13 05:59:28,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:28,663 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 71 treesize of output 37 [2024-10-13 05:59:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 127 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-13 05:59:29,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:59:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:30,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:30,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904300898] [2024-10-13 05:59:30,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904300898] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:59:30,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:59:30,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2024-10-13 05:59:30,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977596299] [2024-10-13 05:59:30,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:30,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:59:30,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:30,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:59:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-10-13 05:59:30,647 INFO L87 Difference]: Start difference. First operand 1597 states and 2168 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:31,141 INFO L93 Difference]: Finished difference Result 3061 states and 4162 transitions. [2024-10-13 05:59:31,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:59:31,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-10-13 05:59:31,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:31,147 INFO L225 Difference]: With dead ends: 3061 [2024-10-13 05:59:31,147 INFO L226 Difference]: Without dead ends: 1599 [2024-10-13 05:59:31,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-10-13 05:59:31,149 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 73 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:31,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 479 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:59:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2024-10-13 05:59:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1365. [2024-10-13 05:59:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1198 states have (on average 1.318864774624374) internal successors, (1580), 1206 states have internal predecessors, (1580), 134 states have call successors, (134), 32 states have call predecessors, (134), 32 states have return successors, (134), 126 states have call predecessors, (134), 134 states have call successors, (134) [2024-10-13 05:59:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1848 transitions. [2024-10-13 05:59:31,207 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1848 transitions. Word has length 113 [2024-10-13 05:59:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:31,207 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 1848 transitions. [2024-10-13 05:59:31,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1848 transitions. [2024-10-13 05:59:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 05:59:31,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:31,209 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:59:31,217 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-13 05:59:31,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-13 05:59:31,410 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:31,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:31,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1029945774, now seen corresponding path program 1 times [2024-10-13 05:59:31,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:31,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682791880] [2024-10-13 05:59:31,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:31,413 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-13 05:59:31,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:31,414 INFO L229 MonitoredProcess]: Starting monitored process 18 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-13 05:59:31,416 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 (18)] Waiting until timeout for monitored process [2024-10-13 05:59:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:31,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 05:59:31,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:32,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:32,335 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 95 treesize of output 35 [2024-10-13 05:59:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 193 proven. 21 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-13 05:59:32,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:59:32,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:32,861 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 100 treesize of output 1 [2024-10-13 05:59:32,885 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:59:32,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:32,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682791880] [2024-10-13 05:59:32,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682791880] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:59:32,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:59:32,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-13 05:59:32,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259907011] [2024-10-13 05:59:32,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:59:32,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 05:59:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:32,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 05:59:32,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:59:32,887 INFO L87 Difference]: Start difference. First operand 1365 states and 1848 transitions. Second operand has 15 states, 13 states have (on average 6.461538461538462) internal successors, (84), 15 states have internal predecessors, (84), 6 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-13 05:59:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:35,272 INFO L93 Difference]: Finished difference Result 2861 states and 3814 transitions. [2024-10-13 05:59:35,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 05:59:35,273 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.461538461538462) internal successors, (84), 15 states have internal predecessors, (84), 6 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) Word has length 113 [2024-10-13 05:59:35,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:35,278 INFO L225 Difference]: With dead ends: 2861 [2024-10-13 05:59:35,279 INFO L226 Difference]: Without dead ends: 1614 [2024-10-13 05:59:35,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2024-10-13 05:59:35,281 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 474 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:35,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1282 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 05:59:35,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2024-10-13 05:59:35,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1164. [2024-10-13 05:59:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1000 states have (on average 1.284) internal successors, (1284), 1007 states have internal predecessors, (1284), 125 states have call successors, (125), 38 states have call predecessors, (125), 38 states have return successors, (125), 118 states have call predecessors, (125), 125 states have call successors, (125) [2024-10-13 05:59:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1534 transitions. [2024-10-13 05:59:35,356 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1534 transitions. Word has length 113 [2024-10-13 05:59:35,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:35,356 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1534 transitions. [2024-10-13 05:59:35,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.461538461538462) internal successors, (84), 15 states have internal predecessors, (84), 6 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-13 05:59:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1534 transitions. [2024-10-13 05:59:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 05:59:35,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:35,358 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:59:35,369 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 (18)] Ended with exit code 0 [2024-10-13 05:59:35,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-13 05:59:35,559 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:35,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:35,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1229361301, now seen corresponding path program 1 times [2024-10-13 05:59:35,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:35,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067020563] [2024-10-13 05:59:35,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:35,560 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-13 05:59:35,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:35,562 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-13 05:59:35,562 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 [2024-10-13 05:59:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:35,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 05:59:35,750 INFO L278 TraceCheckSpWp]: Computing forward predicates...