./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-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 523cdc555ae18a7121d858cb3ce401c3fbc4c545022234654bee429dbd299e9d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:18:50,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:18:50,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:18:50,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:18:50,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:18:50,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:18:50,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:18:50,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:18:50,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:18:50,364 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:18:50,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:18:50,366 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:18:50,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:18:50,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:18:50,368 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:18:50,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:18:50,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:18:50,369 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:18:50,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:18:50,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:18:50,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:18:50,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:18:50,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:18:50,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:18:50,374 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:18:50,374 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:18:50,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:18:50,375 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:18:50,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:18:50,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:18:50,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:18:50,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:18:50,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:18:50,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:18:50,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:18:50,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:18:50,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:18:50,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:18:50,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:18:50,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:18:50,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:18:50,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:18:50,379 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 523cdc555ae18a7121d858cb3ce401c3fbc4c545022234654bee429dbd299e9d [2024-10-11 13:18:50,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:18:50,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:18:50,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:18:50,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:18:50,689 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:18:50,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i [2024-10-11 13:18:52,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:18:52,342 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:18:52,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i [2024-10-11 13:18:52,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b11a6f8e9/a21cd1e1c05f45c698a32fb874cb1b5f/FLAG5c6a6f119 [2024-10-11 13:18:52,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b11a6f8e9/a21cd1e1c05f45c698a32fb874cb1b5f [2024-10-11 13:18:52,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:18:52,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:18:52,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:18:52,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:18:52,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:18:52,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:18:52" (1/1) ... [2024-10-11 13:18:52,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9f6cde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:18:52, skipping insertion in model container [2024-10-11 13:18:52,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:18:52" (1/1) ... [2024-10-11 13:18:52,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:18:52,595 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-57.i[916,929] [2024-10-11 13:18:52,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:18:52,701 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:18:52,713 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-57.i[916,929] [2024-10-11 13:18:52,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:18:52,795 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:18:52,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:18:52 WrapperNode [2024-10-11 13:18:52,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:18:52,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:18:52,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:18:52,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:18:52,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:18:52" (1/1) ... [2024-10-11 13:18:52,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:18:52" (1/1) ... [2024-10-11 13:18:52,858 INFO L138 Inliner]: procedures = 29, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2024-10-11 13:18:52,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:18:52,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:18:52,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:18:52,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:18:52,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:18:52" (1/1) ... [2024-10-11 13:18:52,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:18:52" (1/1) ... [2024-10-11 13:18:52,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:18:52" (1/1) ... [2024-10-11 13:18:52,907 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 24, 3, 72, 9]. 65 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 3, 1, 8, 1]. The 17 writes are split as follows [0, 3, 1, 10, 3]. [2024-10-11 13:18:52,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:18:52" (1/1) ... [2024-10-11 13:18:52,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:18:52" (1/1) ... [2024-10-11 13:18:52,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:18:52" (1/1) ... [2024-10-11 13:18:52,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:18:52" (1/1) ... [2024-10-11 13:18:52,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:18:52" (1/1) ... [2024-10-11 13:18:52,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:18:52" (1/1) ... [2024-10-11 13:18:52,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:18:52,950 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:18:52,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:18:52,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:18:52,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:18:52" (1/1) ... [2024-10-11 13:18:52,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:18:52,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:18:52,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:18:52,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:18:53,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:18:53,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:18:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:18:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:18:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:18:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:18:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:18:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:18:53,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:18:53,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:18:53,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:18:53,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:18:53,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:18:53,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:18:53,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:18:53,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:18:53,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:18:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:18:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:18:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:18:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:18:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:18:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:18:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:18:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:18:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:18:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:18:53,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:18:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:18:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:18:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:18:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:18:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:18:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:18:53,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:18:53,230 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:18:53,236 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:18:53,771 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-10-11 13:18:53,772 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:18:53,809 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:18:53,810 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:18:53,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:18:53 BoogieIcfgContainer [2024-10-11 13:18:53,814 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:18:53,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:18:53,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:18:53,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:18:53,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:18:52" (1/3) ... [2024-10-11 13:18:53,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e28f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:18:53, skipping insertion in model container [2024-10-11 13:18:53,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:18:52" (2/3) ... [2024-10-11 13:18:53,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e28f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:18:53, skipping insertion in model container [2024-10-11 13:18:53,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:18:53" (3/3) ... [2024-10-11 13:18:53,829 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-57.i [2024-10-11 13:18:53,854 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:18:53,855 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:18:53,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:18:53,918 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;@56a1514a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:18:53,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:18:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:18:53,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:18:53,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:53,936 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:18:53,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:53,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:53,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1959191061, now seen corresponding path program 1 times [2024-10-11 13:18:53,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:18:53,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068890430] [2024-10-11 13:18:53,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:53,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:18:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:18:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:18:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:18:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:18:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:18:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:18:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:18:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:18:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:18:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:18:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:18:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:18:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:18:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:18:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:18:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:18:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:18:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:18:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:18:54,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:18:54,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068890430] [2024-10-11 13:18:54,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068890430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:54,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:54,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:18:54,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971057212] [2024-10-11 13:18:54,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:54,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:18:54,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:18:54,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:18:54,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:18:54,427 INFO L87 Difference]: Start difference. First operand has 90 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:18:54,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:54,475 INFO L93 Difference]: Finished difference Result 177 states and 286 transitions. [2024-10-11 13:18:54,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:18:54,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2024-10-11 13:18:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:54,486 INFO L225 Difference]: With dead ends: 177 [2024-10-11 13:18:54,486 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 13:18:54,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-11 13:18:54,494 INFO L432 NwaCegarLoop]: 126 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, 126 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-11 13:18:54,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:18:54,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 13:18:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-11 13:18:54,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 68 states have internal predecessors, (94), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:18:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2024-10-11 13:18:54,541 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 129 [2024-10-11 13:18:54,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:54,542 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2024-10-11 13:18:54,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:18:54,542 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2024-10-11 13:18:54,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:18:54,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:54,546 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:18:54,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:18:54,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:54,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:54,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1634492857, now seen corresponding path program 1 times [2024-10-11 13:18:54,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:18:54,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314800990] [2024-10-11 13:18:54,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:54,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:18:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:18:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:18:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:18:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:18:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:18:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:18:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:18:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:18:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:18:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:18:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:18:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:18:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:18:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:54,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:18:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:18:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:18:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:18:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:18:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:18:55,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:18:55,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314800990] [2024-10-11 13:18:55,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314800990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:55,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:55,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:18:55,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247642984] [2024-10-11 13:18:55,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:55,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:18:55,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:18:55,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:18:55,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:18:55,020 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:18:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:55,082 INFO L93 Difference]: Finished difference Result 178 states and 263 transitions. [2024-10-11 13:18:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:18:55,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-10-11 13:18:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:55,086 INFO L225 Difference]: With dead ends: 178 [2024-10-11 13:18:55,086 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 13:18:55,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-11 13:18:55,088 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:55,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 365 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:18:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 13:18:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-11 13:18:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:18:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-10-11 13:18:55,110 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 129 [2024-10-11 13:18:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:55,112 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-10-11 13:18:55,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:18:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-10-11 13:18:55,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:18:55,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:55,115 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:18:55,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:18:55,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:55,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:55,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1634552439, now seen corresponding path program 1 times [2024-10-11 13:18:55,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:18:55,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487653635] [2024-10-11 13:18:55,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:55,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:18:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:18:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:18:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:18:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:18:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:18:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:18:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:18:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:18:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:18:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:18:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:18:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:18:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:18:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:18:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:18:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:18:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:18:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:18:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,638 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:18:55,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:18:55,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487653635] [2024-10-11 13:18:55,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487653635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:55,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:55,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:18:55,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106653787] [2024-10-11 13:18:55,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:55,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:18:55,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:18:55,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:18:55,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:18:55,643 INFO L87 Difference]: Start difference. First operand 90 states and 132 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:18:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:55,768 INFO L93 Difference]: Finished difference Result 227 states and 334 transitions. [2024-10-11 13:18:55,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:18:55,770 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-10-11 13:18:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:55,773 INFO L225 Difference]: With dead ends: 227 [2024-10-11 13:18:55,773 INFO L226 Difference]: Without dead ends: 138 [2024-10-11 13:18:55,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 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-11 13:18:55,775 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 59 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:55,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 519 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:18:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-11 13:18:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2024-10-11 13:18:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:18:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2024-10-11 13:18:55,789 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 156 transitions. Word has length 129 [2024-10-11 13:18:55,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:55,790 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 156 transitions. [2024-10-11 13:18:55,790 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:18:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 156 transitions. [2024-10-11 13:18:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:18:55,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:55,792 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:18:55,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:18:55,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:55,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:55,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1564751439, now seen corresponding path program 1 times [2024-10-11 13:18:55,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:18:55,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554833466] [2024-10-11 13:18:55,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:55,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:18:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:18:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:18:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:18:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:18:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:18:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:18:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:18:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:18:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:18:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:18:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:18:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:18:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:18:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:18:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:18:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:18:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:18:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:18:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:18:55,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:18:55,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554833466] [2024-10-11 13:18:55,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554833466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:55,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:55,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:18:55,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987084098] [2024-10-11 13:18:55,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:55,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:18:55,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:18:55,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:18:55,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:18:55,929 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:18:55,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:55,960 INFO L93 Difference]: Finished difference Result 250 states and 368 transitions. [2024-10-11 13:18:55,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:18:55,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2024-10-11 13:18:55,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:55,962 INFO L225 Difference]: With dead ends: 250 [2024-10-11 13:18:55,962 INFO L226 Difference]: Without dead ends: 145 [2024-10-11 13:18:55,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:18:55,964 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 57 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:55,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 284 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:18:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-11 13:18:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 106. [2024-10-11 13:18:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:18:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-10-11 13:18:55,979 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 131 [2024-10-11 13:18:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:55,980 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-10-11 13:18:55,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:18:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-10-11 13:18:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 13:18:55,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:55,983 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:18:55,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:18:55,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:55,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:55,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1207188264, now seen corresponding path program 1 times [2024-10-11 13:18:55,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:18:55,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508097230] [2024-10-11 13:18:55,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:55,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:18:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:18:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:18:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:18:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:18:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:18:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:18:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:18:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:18:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:18:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:18:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:18:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:18:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:18:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:18:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:18:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:18:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:18:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:18:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:18:56,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:18:56,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508097230] [2024-10-11 13:18:56,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508097230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:56,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:56,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:18:56,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454602767] [2024-10-11 13:18:56,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:56,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:18:56,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:18:56,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:18:56,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:18:56,387 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:18:56,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:56,722 INFO L93 Difference]: Finished difference Result 301 states and 440 transitions. [2024-10-11 13:18:56,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:18:56,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 132 [2024-10-11 13:18:56,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:56,725 INFO L225 Difference]: With dead ends: 301 [2024-10-11 13:18:56,725 INFO L226 Difference]: Without dead ends: 196 [2024-10-11 13:18:56,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:18:56,726 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 107 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:56,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 385 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:18:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-11 13:18:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 148. [2024-10-11 13:18:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.3027522935779816) internal successors, (142), 109 states have internal predecessors, (142), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 13:18:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 214 transitions. [2024-10-11 13:18:56,760 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 214 transitions. Word has length 132 [2024-10-11 13:18:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:56,761 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 214 transitions. [2024-10-11 13:18:56,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:18:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 214 transitions. [2024-10-11 13:18:56,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 13:18:56,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:56,763 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:18:56,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:18:56,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:56,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:56,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1329452793, now seen corresponding path program 1 times [2024-10-11 13:18:56,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:18:56,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559188623] [2024-10-11 13:18:56,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:56,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:18:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:18:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:18:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:18:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:18:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:18:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:18:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:18:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:18:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:18:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:18:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:18:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:18:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:18:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:18:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:18:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:18:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:18:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:18:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:18:57,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:18:57,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559188623] [2024-10-11 13:18:57,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559188623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:57,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:57,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:18:57,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193066768] [2024-10-11 13:18:57,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:57,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:18:57,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:18:57,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:18:57,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:18:57,224 INFO L87 Difference]: Start difference. First operand 148 states and 214 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:18:57,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:57,348 INFO L93 Difference]: Finished difference Result 302 states and 439 transitions. [2024-10-11 13:18:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:18:57,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-10-11 13:18:57,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:57,350 INFO L225 Difference]: With dead ends: 302 [2024-10-11 13:18:57,350 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 13:18:57,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 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-11 13:18:57,352 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 55 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:57,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 581 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:18:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 13:18:57,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 167. [2024-10-11 13:18:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 128 states have (on average 1.3359375) internal successors, (171), 128 states have internal predecessors, (171), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 13:18:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 243 transitions. [2024-10-11 13:18:57,368 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 243 transitions. Word has length 136 [2024-10-11 13:18:57,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:57,371 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 243 transitions. [2024-10-11 13:18:57,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:18:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 243 transitions. [2024-10-11 13:18:57,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 13:18:57,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:57,373 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:18:57,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:18:57,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:57,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:57,374 INFO L85 PathProgramCache]: Analyzing trace with hash -628388215, now seen corresponding path program 1 times [2024-10-11 13:18:57,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:18:57,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78626301] [2024-10-11 13:18:57,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:57,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:18:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:18:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:18:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:18:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:18:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:18:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:18:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:18:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:18:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:18:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:18:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:18:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:18:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:18:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:18:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:18:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:18:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:18:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:18:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:18:57,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:18:57,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78626301] [2024-10-11 13:18:57,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78626301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:57,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:57,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:18:57,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402574775] [2024-10-11 13:18:57,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:57,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:18:57,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:18:57,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:18:57,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:18:57,872 INFO L87 Difference]: Start difference. First operand 167 states and 243 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:18:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:58,011 INFO L93 Difference]: Finished difference Result 318 states and 463 transitions. [2024-10-11 13:18:58,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:18:58,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-10-11 13:18:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:58,014 INFO L225 Difference]: With dead ends: 318 [2024-10-11 13:18:58,014 INFO L226 Difference]: Without dead ends: 194 [2024-10-11 13:18:58,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:18:58,017 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 164 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:58,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 614 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:18:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-11 13:18:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 146. [2024-10-11 13:18:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 107 states have internal predecessors, (139), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 13:18:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions. [2024-10-11 13:18:58,065 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 136 [2024-10-11 13:18:58,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:58,067 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions. [2024-10-11 13:18:58,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:18:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions. [2024-10-11 13:18:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 13:18:58,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:58,071 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:18:58,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:18:58,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:58,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:58,072 INFO L85 PathProgramCache]: Analyzing trace with hash 759960216, now seen corresponding path program 1 times [2024-10-11 13:18:58,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:18:58,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548830673] [2024-10-11 13:18:58,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:58,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:18:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:18:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:18:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:18:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:18:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:18:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:18:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:18:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:18:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:18:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:18:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:18:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:18:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:18:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:18:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:18:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:18:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:18:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:18:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:18:58,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:18:58,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548830673] [2024-10-11 13:18:58,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548830673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:58,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:58,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:18:58,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813448614] [2024-10-11 13:18:58,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:58,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:18:58,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:18:58,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:18:58,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:18:58,808 INFO L87 Difference]: Start difference. First operand 146 states and 211 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:18:58,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:58,982 INFO L93 Difference]: Finished difference Result 309 states and 447 transitions. [2024-10-11 13:18:58,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:18:58,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 139 [2024-10-11 13:18:58,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:58,985 INFO L225 Difference]: With dead ends: 309 [2024-10-11 13:18:58,985 INFO L226 Difference]: Without dead ends: 206 [2024-10-11 13:18:58,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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-11 13:18:58,988 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 138 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:58,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 458 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:18:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-11 13:18:59,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2024-10-11 13:18:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 159 states have (on average 1.3396226415094339) internal successors, (213), 160 states have internal predecessors, (213), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:18:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 293 transitions. [2024-10-11 13:18:59,016 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 293 transitions. Word has length 139 [2024-10-11 13:18:59,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:59,017 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 293 transitions. [2024-10-11 13:18:59,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:18:59,017 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 293 transitions. [2024-10-11 13:18:59,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 13:18:59,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:59,019 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:18:59,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:18:59,019 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:59,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:59,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1182662042, now seen corresponding path program 1 times [2024-10-11 13:18:59,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:18:59,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142957947] [2024-10-11 13:18:59,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:59,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:18:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:18:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:18:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:18:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:18:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:18:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:18:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:18:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:18:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:18:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:18:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:18:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:18:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:18:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:18:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:18:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:18:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:18:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:18:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:18:59,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:18:59,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142957947] [2024-10-11 13:18:59,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142957947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:59,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:59,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:18:59,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048833411] [2024-10-11 13:18:59,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:59,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:18:59,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:18:59,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:18:59,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:18:59,410 INFO L87 Difference]: Start difference. First operand 203 states and 293 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:18:59,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:59,533 INFO L93 Difference]: Finished difference Result 454 states and 650 transitions. [2024-10-11 13:18:59,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:18:59,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2024-10-11 13:18:59,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:59,538 INFO L225 Difference]: With dead ends: 454 [2024-10-11 13:18:59,538 INFO L226 Difference]: Without dead ends: 294 [2024-10-11 13:18:59,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:18:59,540 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 42 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:59,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 453 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:18:59,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-11 13:18:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2024-10-11 13:18:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 239 states have (on average 1.3389121338912133) internal successors, (320), 242 states have internal predecessors, (320), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 13:18:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 408 transitions. [2024-10-11 13:18:59,569 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 408 transitions. Word has length 139 [2024-10-11 13:18:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:59,570 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 408 transitions. [2024-10-11 13:18:59,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:18:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 408 transitions. [2024-10-11 13:18:59,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 13:18:59,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:59,572 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:18:59,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:18:59,572 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:59,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash 789635032, now seen corresponding path program 1 times [2024-10-11 13:18:59,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:18:59,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328492381] [2024-10-11 13:18:59,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:59,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:18:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:19:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:19:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:19:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:19:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:19:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:19:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:19:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:19:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:19:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:19:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:01,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:01,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328492381] [2024-10-11 13:19:01,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328492381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:01,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:01,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:19:01,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493482748] [2024-10-11 13:19:01,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:01,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:01,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:01,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:01,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:01,669 INFO L87 Difference]: Start difference. First operand 290 states and 408 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:01,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:01,953 INFO L93 Difference]: Finished difference Result 663 states and 925 transitions. [2024-10-11 13:19:01,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:01,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2024-10-11 13:19:01,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:01,958 INFO L225 Difference]: With dead ends: 663 [2024-10-11 13:19:01,958 INFO L226 Difference]: Without dead ends: 420 [2024-10-11 13:19:01,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 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-11 13:19:01,959 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 59 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:01,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 633 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:19:01,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-11 13:19:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 417. [2024-10-11 13:19:01,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 350 states have (on average 1.322857142857143) internal successors, (463), 356 states have internal predecessors, (463), 56 states have call successors, (56), 10 states have call predecessors, (56), 10 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 13:19:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 575 transitions. [2024-10-11 13:19:02,001 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 575 transitions. Word has length 139 [2024-10-11 13:19:02,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:02,002 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 575 transitions. [2024-10-11 13:19:02,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 575 transitions. [2024-10-11 13:19:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 13:19:02,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:02,004 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:02,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:19:02,005 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:02,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:02,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1170363721, now seen corresponding path program 1 times [2024-10-11 13:19:02,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:02,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003483725] [2024-10-11 13:19:02,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:02,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:19:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:19:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:19:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:19:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:19:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:19:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:19:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:19:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:19:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:19:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:02,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:02,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003483725] [2024-10-11 13:19:02,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003483725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:02,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:02,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:19:02,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623512925] [2024-10-11 13:19:02,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:02,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:02,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:02,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:02,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:19:02,276 INFO L87 Difference]: Start difference. First operand 417 states and 575 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:02,439 INFO L93 Difference]: Finished difference Result 1027 states and 1421 transitions. [2024-10-11 13:19:02,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:19:02,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-11 13:19:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:02,444 INFO L225 Difference]: With dead ends: 1027 [2024-10-11 13:19:02,444 INFO L226 Difference]: Without dead ends: 657 [2024-10-11 13:19:02,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:02,446 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 77 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:02,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 499 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:19:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-10-11 13:19:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 441. [2024-10-11 13:19:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 374 states have (on average 1.3315508021390374) internal successors, (498), 380 states have internal predecessors, (498), 56 states have call successors, (56), 10 states have call predecessors, (56), 10 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 13:19:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 610 transitions. [2024-10-11 13:19:02,486 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 610 transitions. Word has length 140 [2024-10-11 13:19:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:02,487 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 610 transitions. [2024-10-11 13:19:02,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 610 transitions. [2024-10-11 13:19:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 13:19:02,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:02,489 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:02,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:19:02,489 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:02,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:02,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1679836811, now seen corresponding path program 1 times [2024-10-11 13:19:02,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:02,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818772214] [2024-10-11 13:19:02,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:02,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:19:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:19:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:19:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:19:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:19:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:19:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:19:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:19:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:19:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:19:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:02,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:02,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818772214] [2024-10-11 13:19:02,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818772214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:02,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:02,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:19:02,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237777973] [2024-10-11 13:19:02,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:02,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:02,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:02,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:02,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:02,930 INFO L87 Difference]: Start difference. First operand 441 states and 610 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:19:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:03,109 INFO L93 Difference]: Finished difference Result 839 states and 1160 transitions. [2024-10-11 13:19:03,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:03,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2024-10-11 13:19:03,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:03,114 INFO L225 Difference]: With dead ends: 839 [2024-10-11 13:19:03,114 INFO L226 Difference]: Without dead ends: 445 [2024-10-11 13:19:03,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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-11 13:19:03,116 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 112 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:03,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 484 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:19:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-11 13:19:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 441. [2024-10-11 13:19:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 374 states have (on average 1.3288770053475936) internal successors, (497), 380 states have internal predecessors, (497), 56 states have call successors, (56), 10 states have call predecessors, (56), 10 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 13:19:03,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 609 transitions. [2024-10-11 13:19:03,173 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 609 transitions. Word has length 140 [2024-10-11 13:19:03,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:03,174 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 609 transitions. [2024-10-11 13:19:03,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:19:03,174 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 609 transitions. [2024-10-11 13:19:03,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 13:19:03,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:03,178 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:03,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:19:03,178 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:03,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:03,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2072863821, now seen corresponding path program 1 times [2024-10-11 13:19:03,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:03,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752002227] [2024-10-11 13:19:03,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:03,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:19:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:19:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:19:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:19:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:19:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:19:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:19:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:19:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:19:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:19:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:03,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:03,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752002227] [2024-10-11 13:19:03,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752002227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:03,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:03,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:19:03,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956367055] [2024-10-11 13:19:03,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:03,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:03,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:03,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:03,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:19:03,507 INFO L87 Difference]: Start difference. First operand 441 states and 609 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:03,626 INFO L93 Difference]: Finished difference Result 799 states and 1101 transitions. [2024-10-11 13:19:03,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:19:03,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-11 13:19:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:03,630 INFO L225 Difference]: With dead ends: 799 [2024-10-11 13:19:03,630 INFO L226 Difference]: Without dead ends: 372 [2024-10-11 13:19:03,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:03,632 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 95 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:03,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 382 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:19:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-11 13:19:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 346. [2024-10-11 13:19:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 285 states have (on average 1.2982456140350878) internal successors, (370), 288 states have internal predecessors, (370), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:19:03,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 470 transitions. [2024-10-11 13:19:03,668 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 470 transitions. Word has length 140 [2024-10-11 13:19:03,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:03,668 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 470 transitions. [2024-10-11 13:19:03,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:03,669 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 470 transitions. [2024-10-11 13:19:03,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 13:19:03,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:03,670 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:03,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:19:03,671 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:03,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:03,671 INFO L85 PathProgramCache]: Analyzing trace with hash -293633417, now seen corresponding path program 1 times [2024-10-11 13:19:03,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:03,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402929001] [2024-10-11 13:19:03,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:03,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:19:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:19:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:19:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:19:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:19:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:19:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:19:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:19:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:19:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:19:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:19:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:19:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:19:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:19:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:19:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:19:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:19:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:19:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:04,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:19:04,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402929001] [2024-10-11 13:19:04,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402929001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:04,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:04,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:19:04,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67339196] [2024-10-11 13:19:04,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:04,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:04,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:19:04,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:04,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:04,097 INFO L87 Difference]: Start difference. First operand 346 states and 470 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:19:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:04,276 INFO L93 Difference]: Finished difference Result 703 states and 949 transitions. [2024-10-11 13:19:04,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:19:04,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2024-10-11 13:19:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:04,282 INFO L225 Difference]: With dead ends: 703 [2024-10-11 13:19:04,282 INFO L226 Difference]: Without dead ends: 404 [2024-10-11 13:19:04,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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-11 13:19:04,284 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 125 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:04,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 537 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:19:04,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-10-11 13:19:04,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 351. [2024-10-11 13:19:04,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 289 states have (on average 1.2941176470588236) internal successors, (374), 292 states have internal predecessors, (374), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:19:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 474 transitions. [2024-10-11 13:19:04,326 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 474 transitions. Word has length 140 [2024-10-11 13:19:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:04,327 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 474 transitions. [2024-10-11 13:19:04,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:19:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 474 transitions. [2024-10-11 13:19:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 13:19:04,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:04,328 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:04,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 13:19:04,329 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:04,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:04,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1089595767, now seen corresponding path program 1 times [2024-10-11 13:19:04,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:19:04,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376624274] [2024-10-11 13:19:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:04,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:19:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:19:04,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:19:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:19:04,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:19:04,646 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:19:04,647 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:19:04,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 13:19:04,652 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:04,776 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:19:04,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:19:04 BoogieIcfgContainer [2024-10-11 13:19:04,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:19:04,782 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:19:04,782 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:19:04,782 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:19:04,782 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:18:53" (3/4) ... [2024-10-11 13:19:04,784 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:19:04,786 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:19:04,786 INFO L158 Benchmark]: Toolchain (without parser) took 12413.04ms. Allocated memory was 180.4MB in the beginning and 415.2MB in the end (delta: 234.9MB). Free memory was 151.3MB in the beginning and 378.0MB in the end (delta: -226.8MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-10-11 13:19:04,786 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:19:04,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.69ms. Allocated memory is still 180.4MB. Free memory was 151.3MB in the beginning and 134.7MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:19:04,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.67ms. Allocated memory is still 180.4MB. Free memory was 134.7MB in the beginning and 130.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:19:04,788 INFO L158 Benchmark]: Boogie Preprocessor took 86.29ms. Allocated memory is still 180.4MB. Free memory was 130.5MB in the beginning and 126.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:19:04,788 INFO L158 Benchmark]: RCFGBuilder took 863.72ms. Allocated memory is still 180.4MB. Free memory was 126.3MB in the beginning and 122.4MB in the end (delta: 3.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:19:04,788 INFO L158 Benchmark]: TraceAbstraction took 10965.30ms. Allocated memory was 180.4MB in the beginning and 415.2MB in the end (delta: 234.9MB). Free memory was 122.4MB in the beginning and 378.0MB in the end (delta: -255.6MB). Peak memory consumption was 223.6MB. Max. memory is 16.1GB. [2024-10-11 13:19:04,789 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 415.2MB. Free memory is still 378.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:19:04,790 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.15ms. Allocated memory is still 109.1MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.69ms. Allocated memory is still 180.4MB. Free memory was 151.3MB in the beginning and 134.7MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.67ms. Allocated memory is still 180.4MB. Free memory was 134.7MB in the beginning and 130.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.29ms. Allocated memory is still 180.4MB. Free memory was 130.5MB in the beginning and 126.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 863.72ms. Allocated memory is still 180.4MB. Free memory was 126.3MB in the beginning and 122.4MB in the end (delta: 3.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10965.30ms. Allocated memory was 180.4MB in the beginning and 415.2MB in the end (delta: 234.9MB). Free memory was 122.4MB in the beginning and 378.0MB in the end (delta: -255.6MB). Peak memory consumption was 223.6MB. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 415.2MB. Free memory is still 378.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L25-L27] float float_Array_0[1] = { 63.5 }; [L25-L27] float float_Array_0[1] = { 63.5 }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1 }; [L34] signed char last_1_signed_char_Array_0_1__0__0_ = 64; [L35] signed char last_1_signed_char_Array_0_0__1__1_ = -64; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L96] EXPR signed_char_Array_0[1][0][0] [L96] last_1_signed_char_Array_0_1__0__0_ = signed_char_Array_0[1][0][0] [L97] EXPR signed_char_Array_0[0][1][1] [L97] last_1_signed_char_Array_0_0__1__1_ = signed_char_Array_0[0][1][1] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L67] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L70] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L73] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L76] signed_char_Array_0[0][0][0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[0][0][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[0][0][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] EXPR signed_char_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[0][0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[0][0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L79] signed_char_Array_0[0][1][0] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[0][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[0][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L81] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[0][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[0][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L82] signed_char_Array_0[1][1][0] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[1][1][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[1][1][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR signed_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[1][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[1][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L85] signed_char_Array_0[0][0][1] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0][0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0][0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L87] EXPR signed_char_Array_0[0][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L88] signed_char_Array_0[1][0][1] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L90] EXPR signed_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[1][0][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[1][0][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L91] signed_char_Array_0[1][1][1] = __VERIFIER_nondet_char() [L92] EXPR signed_char_Array_0[1][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L92] CALL assume_abort_if_not(signed_char_Array_0[1][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L92] RET assume_abort_if_not(signed_char_Array_0[1][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L93] EXPR signed_char_Array_0[1][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(signed_char_Array_0[1][1][1] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L93] RET assume_abort_if_not(signed_char_Array_0[1][1][1] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L108] RET updateVariables() [L109] CALL step() [L39] EXPR BOOL_unsigned_char_Array_0[0] [L39] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L40] COND TRUE ! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_) [L41] EXPR BOOL_unsigned_char_Array_0[2] [L41] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-255] [L41] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L41] COND TRUE (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && stepLocal_0 [L42] signed_long_int_Array_0[0] = ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L49] EXPR signed_char_Array_0[1][1][1] [L49] EXPR signed_char_Array_0[1][0][1] [L49] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L49] EXPR ((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]) [L49] EXPR ((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L49] signed long int stepLocal_3 = (signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))); [L50] EXPR signed_char_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L50] COND TRUE signed_char_Array_0[0][0][0] < stepLocal_3 [L51] EXPR signed_char_Array_0[1][0][1] [L51] EXPR signed_char_Array_0[0][1][0] [L51] signed_char_Array_0[0][1][1] = ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]) [L55] float_Array_0[0] = 128.91f [L56] EXPR signed_char_Array_0[0][1][1] [L56] EXPR signed_long_int_Array_0[0] [L56] unsigned char stepLocal_2 = signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0]; [L57] EXPR BOOL_unsigned_char_Array_0[1] [L57] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[1]; [L58] stepLocal_1 && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_2=0] [L58] stepLocal_1 && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L58] COND FALSE !(stepLocal_1 && BOOL_unsigned_char_Array_0[2]) [L63] EXPR signed_char_Array_0[0][0][0] [L63] EXPR signed_char_Array_0[0][1][0] [L63] signed_char_Array_0[1][0][0] = (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) [L100] EXPR BOOL_unsigned_char_Array_0[2] [L100] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0] [L100] EXPR BOOL_unsigned_char_Array_0[0] [L100] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) [L100] EXPR signed_long_int_Array_0[0] [L100] EXPR ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0])))) [L100] EXPR BOOL_unsigned_char_Array_0[1] [L100] EXPR BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))) [L100] EXPR signed_char_Array_0[1][0][0] [L100] EXPR signed_char_Array_0[0][0][0] [L100] EXPR signed_char_Array_0[0][1][0] [L100] EXPR (BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1])))))) [L100] EXPR signed_char_Array_0[0][0][0] [L100] EXPR signed_char_Array_0[1][1][1] [L100] EXPR signed_char_Array_0[1][0][1] [L100] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]) [L100] EXPR ((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) [L100] EXPR signed_char_Array_0[0][1][1] [L100] EXPR signed_char_Array_0[1][0][1] [L100] EXPR signed_char_Array_0[0][1][0] [L100] EXPR (signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))))) && (float_Array_0[0] == ((float) 128.91f)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))))) && (float_Array_0[0] == ((float) 128.91f)) [L100] EXPR float_Array_0[0] [L100] EXPR ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))))) && (float_Array_0[0] == ((float) 128.91f)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100-L101] return ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))))) && (float_Array_0[0] == ((float) 128.91f)) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 15, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1094 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1091 mSDsluCounter, 6320 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4469 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1078 IncrementalHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 1851 mSDtfsCounter, 1078 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 625 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=441occurred in iteration=11, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 507 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 2041 NumberOfCodeBlocks, 2041 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1885 ConstructedInterpolants, 0 QuantifiedInterpolants, 6018 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 8568/8568 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-11 13:19:04,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 523cdc555ae18a7121d858cb3ce401c3fbc4c545022234654bee429dbd299e9d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:19:07,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:19:07,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:19:07,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:19:07,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:19:07,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:19:07,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:19:07,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:19:07,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:19:07,352 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:19:07,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:19:07,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:19:07,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:19:07,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:19:07,354 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:19:07,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:19:07,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:19:07,358 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:19:07,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:19:07,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:19:07,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:19:07,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:19:07,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:19:07,363 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:19:07,363 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:19:07,363 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:19:07,364 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:19:07,364 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:19:07,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:19:07,364 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:19:07,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:19:07,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:19:07,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:19:07,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:19:07,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:19:07,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:19:07,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:19:07,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:19:07,367 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:19:07,367 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:19:07,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:19:07,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:19:07,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:19:07,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:19:07,370 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:19:07,370 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 523cdc555ae18a7121d858cb3ce401c3fbc4c545022234654bee429dbd299e9d [2024-10-11 13:19:07,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:19:07,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:19:07,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:19:07,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:19:07,779 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:19:07,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i [2024-10-11 13:19:09,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:19:09,639 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:19:09,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i [2024-10-11 13:19:09,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aebe7bb01/f502f3b5615e45b7ad1b1e2615d77388/FLAGf0dd0b9d6 [2024-10-11 13:19:09,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aebe7bb01/f502f3b5615e45b7ad1b1e2615d77388 [2024-10-11 13:19:09,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:19:09,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:19:09,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:19:09,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:19:09,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:19:09,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:19:09" (1/1) ... [2024-10-11 13:19:09,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464ee4f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:09, skipping insertion in model container [2024-10-11 13:19:09,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:19:09" (1/1) ... [2024-10-11 13:19:09,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:19:09,927 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-57.i[916,929] [2024-10-11 13:19:10,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:19:10,054 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:19:10,068 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-57.i[916,929] [2024-10-11 13:19:10,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:19:10,197 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:19:10,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:10 WrapperNode [2024-10-11 13:19:10,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:19:10,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:19:10,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:19:10,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:19:10,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:10" (1/1) ... [2024-10-11 13:19:10,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:10" (1/1) ... [2024-10-11 13:19:10,276 INFO L138 Inliner]: procedures = 33, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2024-10-11 13:19:10,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:19:10,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:19:10,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:19:10,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:19:10,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:10" (1/1) ... [2024-10-11 13:19:10,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:10" (1/1) ... [2024-10-11 13:19:10,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:10" (1/1) ... [2024-10-11 13:19:10,335 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 24, 3, 72, 9]. 65 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 3, 1, 8, 1]. The 17 writes are split as follows [0, 3, 1, 10, 3]. [2024-10-11 13:19:10,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:10" (1/1) ... [2024-10-11 13:19:10,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:10" (1/1) ... [2024-10-11 13:19:10,366 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:10" (1/1) ... [2024-10-11 13:19:10,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:10" (1/1) ... [2024-10-11 13:19:10,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:10" (1/1) ... [2024-10-11 13:19:10,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:10" (1/1) ... [2024-10-11 13:19:10,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:19:10,392 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:19:10,393 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:19:10,393 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:19:10,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:10" (1/1) ... [2024-10-11 13:19:10,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:19:10,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:19:10,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:19:10,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:19:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:19:10,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:19:10,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:19:10,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:19:10,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:19:10,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:19:10,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:19:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:19:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:19:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:19:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:19:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:19:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:19:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 13:19:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 13:19:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-11 13:19:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:19:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:19:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:19:10,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:19:10,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:19:10,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:19:10,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:19:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 13:19:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 13:19:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 13:19:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:19:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:19:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:19:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:19:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:19:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:19:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:19:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:19:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:19:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:19:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:19:10,501 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:19:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:19:10,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:19:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:19:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:19:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:19:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:19:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:19:10,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:19:10,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:19:10,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 13:19:10,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 13:19:10,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 13:19:10,663 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:19:10,669 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:19:11,274 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-10-11 13:19:11,275 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:19:11,334 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:19:11,334 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:19:11,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:19:11 BoogieIcfgContainer [2024-10-11 13:19:11,335 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:19:11,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:19:11,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:19:11,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:19:11,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:19:09" (1/3) ... [2024-10-11 13:19:11,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fbefc29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:19:11, skipping insertion in model container [2024-10-11 13:19:11,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:19:10" (2/3) ... [2024-10-11 13:19:11,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fbefc29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:19:11, skipping insertion in model container [2024-10-11 13:19:11,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:19:11" (3/3) ... [2024-10-11 13:19:11,346 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-57.i [2024-10-11 13:19:11,363 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:19:11,364 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:19:11,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:19:11,444 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;@5d251c3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:19:11,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:19:11,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:19:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:19:11,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:11,464 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:11,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:11,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:11,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1959191061, now seen corresponding path program 1 times [2024-10-11 13:19:11,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:11,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280095693] [2024-10-11 13:19:11,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:11,489 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-11 13:19:11,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:11,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 13:19:11,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:11,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:19:11,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-11 13:19:11,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:19:11,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:11,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280095693] [2024-10-11 13:19:11,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280095693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:11,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:11,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:19:11,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103668197] [2024-10-11 13:19:11,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:11,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:19:11,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:11,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:19:11,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:19:11,888 INFO L87 Difference]: Start difference. First operand has 90 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:19:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:11,943 INFO L93 Difference]: Finished difference Result 177 states and 286 transitions. [2024-10-11 13:19:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:19:11,947 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2024-10-11 13:19:11,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:11,957 INFO L225 Difference]: With dead ends: 177 [2024-10-11 13:19:11,957 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 13:19:11,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-11 13:19:11,966 INFO L432 NwaCegarLoop]: 126 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, 126 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-11 13:19:11,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:19:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 13:19:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-11 13:19:12,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 68 states have internal predecessors, (94), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:19:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2024-10-11 13:19:12,028 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 129 [2024-10-11 13:19:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:12,029 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2024-10-11 13:19:12,031 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:19:12,031 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2024-10-11 13:19:12,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:19:12,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:12,043 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:12,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:19:12,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 13:19:12,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:12,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:12,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1634492857, now seen corresponding path program 1 times [2024-10-11 13:19:12,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:12,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589665048] [2024-10-11 13:19:12,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:12,249 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-11 13:19:12,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:12,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 13:19:12,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:12,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:19:12,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:12,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:12,608 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 41 treesize of output 17 [2024-10-11 13:19:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:13,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:19:13,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:13,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589665048] [2024-10-11 13:19:13,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589665048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:13,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:13,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:19:13,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054608903] [2024-10-11 13:19:13,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:13,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:19:13,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:13,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:19:13,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:19:13,266 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:13,704 INFO L93 Difference]: Finished difference Result 263 states and 389 transitions. [2024-10-11 13:19:13,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:19:13,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-10-11 13:19:13,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:13,709 INFO L225 Difference]: With dead ends: 263 [2024-10-11 13:19:13,709 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 13:19:13,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 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-11 13:19:13,714 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 97 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:13,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 304 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:19:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 13:19:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 146. [2024-10-11 13:19:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 107 states have internal predecessors, (142), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 13:19:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 214 transitions. [2024-10-11 13:19:13,764 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 214 transitions. Word has length 129 [2024-10-11 13:19:13,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:13,766 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 214 transitions. [2024-10-11 13:19:13,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 214 transitions. [2024-10-11 13:19:13,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 13:19:13,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:13,768 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:13,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:13,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 13:19:13,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:13,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:13,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1329512375, now seen corresponding path program 1 times [2024-10-11 13:19:13,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:13,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128411362] [2024-10-11 13:19:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:13,975 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-11 13:19:13,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:13,980 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 13:19:13,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 13:19:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:14,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:19:14,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-11 13:19:14,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:19:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:14,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:14,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128411362] [2024-10-11 13:19:14,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128411362] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:19:14,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:19:14,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-10-11 13:19:14,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061259187] [2024-10-11 13:19:14,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:14,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:14,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:14,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:14,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:19:14,835 INFO L87 Difference]: Start difference. First operand 146 states and 214 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:15,002 INFO L93 Difference]: Finished difference Result 309 states and 455 transitions. [2024-10-11 13:19:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:19:15,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-10-11 13:19:15,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:15,006 INFO L225 Difference]: With dead ends: 309 [2024-10-11 13:19:15,007 INFO L226 Difference]: Without dead ends: 220 [2024-10-11 13:19:15,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:19:15,017 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 142 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:15,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 357 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:19:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-11 13:19:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2024-10-11 13:19:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 173 states have (on average 1.3872832369942196) internal successors, (240), 174 states have internal predecessors, (240), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:19:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 320 transitions. [2024-10-11 13:19:15,049 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 320 transitions. Word has length 136 [2024-10-11 13:19:15,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:15,050 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 320 transitions. [2024-10-11 13:19:15,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 320 transitions. [2024-10-11 13:19:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 13:19:15,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:15,053 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:15,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 13:19:15,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 13:19:15,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:15,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:15,255 INFO L85 PathProgramCache]: Analyzing trace with hash 971310215, now seen corresponding path program 1 times [2024-10-11 13:19:15,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:15,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352339414] [2024-10-11 13:19:15,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:15,257 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-11 13:19:15,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:15,260 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 13:19:15,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:15,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 13:19:15,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:15,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:15,496 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 41 treesize of output 17 [2024-10-11 13:19:16,012 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 45 treesize of output 32 [2024-10-11 13:19:16,018 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-11 13:19:16,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 8 [2024-10-11 13:19:16,203 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 91 treesize of output 79 [2024-10-11 13:19:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:16,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:19:16,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:16,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352339414] [2024-10-11 13:19:16,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352339414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:16,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:16,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:19:16,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354599974] [2024-10-11 13:19:16,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:16,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:19:16,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:16,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:19:16,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:19:16,251 INFO L87 Difference]: Start difference. First operand 217 states and 320 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:16,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:16,904 INFO L93 Difference]: Finished difference Result 417 states and 618 transitions. [2024-10-11 13:19:16,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:19:16,904 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-10-11 13:19:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:16,910 INFO L225 Difference]: With dead ends: 417 [2024-10-11 13:19:16,910 INFO L226 Difference]: Without dead ends: 275 [2024-10-11 13:19:16,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:19:16,912 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 132 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:16,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 584 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:19:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-11 13:19:16,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 231. [2024-10-11 13:19:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 187 states have (on average 1.3903743315508021) internal successors, (260), 188 states have internal predecessors, (260), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:19:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 340 transitions. [2024-10-11 13:19:16,941 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 340 transitions. Word has length 136 [2024-10-11 13:19:16,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:16,941 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 340 transitions. [2024-10-11 13:19:16,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:16,942 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 340 transitions. [2024-10-11 13:19:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 13:19:16,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:16,943 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:16,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 13:19:17,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 13:19:17,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:17,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:17,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1182602460, now seen corresponding path program 1 times [2024-10-11 13:19:17,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:17,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290997013] [2024-10-11 13:19:17,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:17,146 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-11 13:19:17,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:17,147 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 13:19:17,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:17,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:19:17,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:17,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:19:17,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:17,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290997013] [2024-10-11 13:19:17,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290997013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:17,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:17,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:19:17,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471359325] [2024-10-11 13:19:17,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:17,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:17,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:17,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:17,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:19:17,446 INFO L87 Difference]: Start difference. First operand 231 states and 340 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:17,585 INFO L93 Difference]: Finished difference Result 491 states and 715 transitions. [2024-10-11 13:19:17,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:19:17,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2024-10-11 13:19:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:17,589 INFO L225 Difference]: With dead ends: 491 [2024-10-11 13:19:17,590 INFO L226 Difference]: Without dead ends: 325 [2024-10-11 13:19:17,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 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-11 13:19:17,592 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 38 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:17,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 443 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:19:17,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-11 13:19:17,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 321. [2024-10-11 13:19:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 270 states have (on average 1.3666666666666667) internal successors, (369), 273 states have internal predecessors, (369), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 13:19:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 457 transitions. [2024-10-11 13:19:17,628 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 457 transitions. Word has length 139 [2024-10-11 13:19:17,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:17,630 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 457 transitions. [2024-10-11 13:19:17,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 457 transitions. [2024-10-11 13:19:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 13:19:17,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:17,634 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:17,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:19:17,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-11 13:19:17,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:17,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:17,835 INFO L85 PathProgramCache]: Analyzing trace with hash 789575450, now seen corresponding path program 1 times [2024-10-11 13:19:17,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:17,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589275047] [2024-10-11 13:19:17,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:17,836 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-11 13:19:17,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:17,839 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 13:19:17,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:18,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:19:18,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:18,073 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:19:18,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:18,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589275047] [2024-10-11 13:19:18,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589275047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:18,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:18,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:19:18,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516592346] [2024-10-11 13:19:18,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:18,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:19:18,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:18,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:19:18,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:19:18,079 INFO L87 Difference]: Start difference. First operand 321 states and 457 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:18,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:18,140 INFO L93 Difference]: Finished difference Result 542 states and 774 transitions. [2024-10-11 13:19:18,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:19:18,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2024-10-11 13:19:18,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:18,146 INFO L225 Difference]: With dead ends: 542 [2024-10-11 13:19:18,146 INFO L226 Difference]: Without dead ends: 333 [2024-10-11 13:19:18,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 136 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-11 13:19:18,148 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:18,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 365 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:19:18,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-11 13:19:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2024-10-11 13:19:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 278 states have (on average 1.356115107913669) internal successors, (377), 281 states have internal predecessors, (377), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 13:19:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 465 transitions. [2024-10-11 13:19:18,179 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 465 transitions. Word has length 139 [2024-10-11 13:19:18,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:18,180 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 465 transitions. [2024-10-11 13:19:18,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:18,181 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 465 transitions. [2024-10-11 13:19:18,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 13:19:18,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:18,182 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:18,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-11 13:19:18,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-11 13:19:18,383 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:18,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash 789635032, now seen corresponding path program 1 times [2024-10-11 13:19:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:18,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846790150] [2024-10-11 13:19:18,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:18,384 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-11 13:19:18,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:18,386 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-11 13:19:18,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:18,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 13:19:18,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:18,620 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-11 13:19:18,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-10-11 13:19:18,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:18,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2024-10-11 13:19:19,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:19,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2024-10-11 13:19:19,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:19,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2024-10-11 13:19:19,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:19,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 41 [2024-10-11 13:19:19,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:19,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 78 [2024-10-11 13:19:20,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:20,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 116 treesize of output 99 [2024-10-11 13:19:20,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:20,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 182 treesize of output 88 [2024-10-11 13:19:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 57 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-10-11 13:19:20,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:19:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:20,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:20,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846790150] [2024-10-11 13:19:20,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846790150] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:19:20,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:19:20,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 21 [2024-10-11 13:19:20,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561394925] [2024-10-11 13:19:20,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:20,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:20,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:20,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:20,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:19:20,841 INFO L87 Difference]: Start difference. First operand 329 states and 465 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:21,167 INFO L93 Difference]: Finished difference Result 621 states and 876 transitions. [2024-10-11 13:19:21,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:21,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2024-10-11 13:19:21,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:21,170 INFO L225 Difference]: With dead ends: 621 [2024-10-11 13:19:21,170 INFO L226 Difference]: Without dead ends: 404 [2024-10-11 13:19:21,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 255 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:19:21,172 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 60 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:21,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 637 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:19:21,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-10-11 13:19:21,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2024-10-11 13:19:21,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 340 states have (on average 1.3470588235294119) internal successors, (458), 344 states have internal predecessors, (458), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:19:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 562 transitions. [2024-10-11 13:19:21,196 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 562 transitions. Word has length 139 [2024-10-11 13:19:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:21,196 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 562 transitions. [2024-10-11 13:19:21,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 562 transitions. [2024-10-11 13:19:21,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 13:19:21,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:21,198 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:21,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:21,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-11 13:19:21,399 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:21,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:21,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1170363721, now seen corresponding path program 1 times [2024-10-11 13:19:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:21,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846990693] [2024-10-11 13:19:21,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:21,400 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-11 13:19:21,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:21,403 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-11 13:19:21,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:21,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:19:21,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:21,597 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-11 13:19:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:21,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:19:21,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:21,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846990693] [2024-10-11 13:19:21,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846990693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:21,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:21,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:19:21,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132878457] [2024-10-11 13:19:21,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:21,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:21,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:21,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:21,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:19:21,643 INFO L87 Difference]: Start difference. First operand 401 states and 562 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:21,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:21,975 INFO L93 Difference]: Finished difference Result 974 states and 1372 transitions. [2024-10-11 13:19:21,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:19:21,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-11 13:19:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:21,980 INFO L225 Difference]: With dead ends: 974 [2024-10-11 13:19:21,981 INFO L226 Difference]: Without dead ends: 676 [2024-10-11 13:19:21,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 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-11 13:19:21,983 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 79 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:21,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 509 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:19:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-10-11 13:19:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 441. [2024-10-11 13:19:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 380 states have (on average 1.3578947368421053) internal successors, (516), 384 states have internal predecessors, (516), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:19:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 620 transitions. [2024-10-11 13:19:22,020 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 620 transitions. Word has length 140 [2024-10-11 13:19:22,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:22,020 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 620 transitions. [2024-10-11 13:19:22,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:22,021 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 620 transitions. [2024-10-11 13:19:22,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 13:19:22,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:22,024 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:22,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:22,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-11 13:19:22,226 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:22,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:22,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1679836811, now seen corresponding path program 1 times [2024-10-11 13:19:22,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:22,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786300034] [2024-10-11 13:19:22,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:22,228 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-11 13:19:22,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:22,231 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-11 13:19:22,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:22,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:19:22,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:22,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:19:22,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:22,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786300034] [2024-10-11 13:19:22,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786300034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:22,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:22,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:19:22,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791692821] [2024-10-11 13:19:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:22,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:22,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:22,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:22,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:22,478 INFO L87 Difference]: Start difference. First operand 441 states and 620 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:22,676 INFO L93 Difference]: Finished difference Result 870 states and 1223 transitions. [2024-10-11 13:19:22,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:19:22,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-11 13:19:22,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:22,680 INFO L225 Difference]: With dead ends: 870 [2024-10-11 13:19:22,680 INFO L226 Difference]: Without dead ends: 555 [2024-10-11 13:19:22,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:19:22,683 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 73 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:22,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 798 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:19:22,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-10-11 13:19:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 477. [2024-10-11 13:19:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 416 states have (on average 1.3557692307692308) internal successors, (564), 420 states have internal predecessors, (564), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:19:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 668 transitions. [2024-10-11 13:19:22,708 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 668 transitions. Word has length 140 [2024-10-11 13:19:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:22,709 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 668 transitions. [2024-10-11 13:19:22,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 668 transitions. [2024-10-11 13:19:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 13:19:22,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:22,711 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:22,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:22,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-11 13:19:22,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:22,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:22,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1604013235, now seen corresponding path program 1 times [2024-10-11 13:19:22,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:22,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046486926] [2024-10-11 13:19:22,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:22,913 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-11 13:19:22,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:22,916 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-11 13:19:22,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:23,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:19:23,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-11 13:19:23,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:19:23,541 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:23,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:23,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046486926] [2024-10-11 13:19:23,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046486926] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:19:23,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:19:23,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-10-11 13:19:23,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390291990] [2024-10-11 13:19:23,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:23,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:23,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:23,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:23,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:19:23,544 INFO L87 Difference]: Start difference. First operand 477 states and 668 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:23,689 INFO L93 Difference]: Finished difference Result 799 states and 1119 transitions. [2024-10-11 13:19:23,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:19:23,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-11 13:19:23,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:23,693 INFO L225 Difference]: With dead ends: 799 [2024-10-11 13:19:23,693 INFO L226 Difference]: Without dead ends: 481 [2024-10-11 13:19:23,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:19:23,694 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 116 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:23,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 377 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:19:23,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-10-11 13:19:23,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 477. [2024-10-11 13:19:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 416 states have (on average 1.3533653846153846) internal successors, (563), 420 states have internal predecessors, (563), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:19:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 667 transitions. [2024-10-11 13:19:23,716 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 667 transitions. Word has length 140 [2024-10-11 13:19:23,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:23,716 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 667 transitions. [2024-10-11 13:19:23,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:23,716 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 667 transitions. [2024-10-11 13:19:23,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 13:19:23,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:23,718 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:23,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:23,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/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-11 13:19:23,922 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:23,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:23,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1210986225, now seen corresponding path program 1 times [2024-10-11 13:19:23,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:23,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011770287] [2024-10-11 13:19:23,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:23,924 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-11 13:19:23,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:23,927 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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-11 13:19:23,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:24,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:19:24,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:24,156 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:19:24,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:24,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011770287] [2024-10-11 13:19:24,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011770287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:24,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:24,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:19:24,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021554839] [2024-10-11 13:19:24,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:24,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:24,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:24,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:24,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:19:24,157 INFO L87 Difference]: Start difference. First operand 477 states and 667 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:24,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:24,300 INFO L93 Difference]: Finished difference Result 807 states and 1122 transitions. [2024-10-11 13:19:24,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:19:24,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-11 13:19:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:24,306 INFO L225 Difference]: With dead ends: 807 [2024-10-11 13:19:24,307 INFO L226 Difference]: Without dead ends: 489 [2024-10-11 13:19:24,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:24,308 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 51 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:24,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 517 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:19:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-10-11 13:19:24,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 461. [2024-10-11 13:19:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 400 states have (on average 1.345) internal successors, (538), 403 states have internal predecessors, (538), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:19:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 638 transitions. [2024-10-11 13:19:24,339 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 638 transitions. Word has length 140 [2024-10-11 13:19:24,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:24,339 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 638 transitions. [2024-10-11 13:19:24,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:24,340 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 638 transitions. [2024-10-11 13:19:24,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 13:19:24,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:24,341 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:24,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 13:19:24,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/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-11 13:19:24,542 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:24,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:24,543 INFO L85 PathProgramCache]: Analyzing trace with hash -293633417, now seen corresponding path program 1 times [2024-10-11 13:19:24,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:24,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586378711] [2024-10-11 13:19:24,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:24,543 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-11 13:19:24,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:24,546 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/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-11 13:19:24,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:24,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:19:24,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:24,961 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-11 13:19:24,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:19:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:25,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:25,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586378711] [2024-10-11 13:19:25,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586378711] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:19:25,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:19:25,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-10-11 13:19:25,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838958918] [2024-10-11 13:19:25,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:25,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:25,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:25,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:25,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:19:25,067 INFO L87 Difference]: Start difference. First operand 461 states and 638 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:25,197 INFO L93 Difference]: Finished difference Result 842 states and 1160 transitions. [2024-10-11 13:19:25,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:25,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-11 13:19:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:25,201 INFO L225 Difference]: With dead ends: 842 [2024-10-11 13:19:25,201 INFO L226 Difference]: Without dead ends: 526 [2024-10-11 13:19:25,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:19:25,203 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 69 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:25,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 518 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:19:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-11 13:19:25,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 448. [2024-10-11 13:19:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 386 states have (on average 1.3419689119170986) internal successors, (518), 389 states have internal predecessors, (518), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:19:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 618 transitions. [2024-10-11 13:19:25,227 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 618 transitions. Word has length 140 [2024-10-11 13:19:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:25,228 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 618 transitions. [2024-10-11 13:19:25,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 618 transitions. [2024-10-11 13:19:25,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 13:19:25,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:25,230 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:25,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:25,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/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-11 13:19:25,430 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:25,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:25,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1089595767, now seen corresponding path program 1 times [2024-10-11 13:19:25,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:25,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338090060] [2024-10-11 13:19:25,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:25,431 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-11 13:19:25,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:25,432 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/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-11 13:19:25,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:25,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:19:25,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:25,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:19:25,859 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 77 treesize of output 41 [2024-10-11 13:19:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:25,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:19:25,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:25,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338090060] [2024-10-11 13:19:25,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338090060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:25,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:25,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:19:25,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931698782] [2024-10-11 13:19:25,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:25,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:25,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:25,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:25,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:25,877 INFO L87 Difference]: Start difference. First operand 448 states and 618 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:26,027 INFO L93 Difference]: Finished difference Result 458 states and 631 transitions. [2024-10-11 13:19:26,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:26,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-11 13:19:26,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:26,032 INFO L225 Difference]: With dead ends: 458 [2024-10-11 13:19:26,032 INFO L226 Difference]: Without dead ends: 456 [2024-10-11 13:19:26,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:19:26,033 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 155 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:26,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 608 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:19:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-11 13:19:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2024-10-11 13:19:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 394 states have (on average 1.3350253807106598) internal successors, (526), 397 states have internal predecessors, (526), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:19:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 626 transitions. [2024-10-11 13:19:26,059 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 626 transitions. Word has length 142 [2024-10-11 13:19:26,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:26,060 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 626 transitions. [2024-10-11 13:19:26,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:26,060 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 626 transitions. [2024-10-11 13:19:26,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 13:19:26,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:26,062 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:26,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 13:19:26,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/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-11 13:19:26,263 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:26,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:26,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1089655349, now seen corresponding path program 1 times [2024-10-11 13:19:26,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:26,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218194023] [2024-10-11 13:19:26,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:26,264 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-11 13:19:26,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:26,266 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/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-11 13:19:26,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:26,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 13:19:26,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:26,542 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-11 13:19:26,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-10-11 13:19:26,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:26,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-10-11 13:19:26,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2024-10-11 13:19:27,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:27,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 73 [2024-10-11 13:19:28,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:28,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 120 treesize of output 101 [2024-10-11 13:19:28,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:28,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 105 treesize of output 116 [2024-10-11 13:19:29,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:29,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 92 [2024-10-11 13:19:29,502 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 455 proven. 33 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-11 13:19:29,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:19:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:29,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:29,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218194023] [2024-10-11 13:19:29,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218194023] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:19:29,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:19:29,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [26] total 28 [2024-10-11 13:19:29,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451978988] [2024-10-11 13:19:29,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:29,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:29,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:29,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:29,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2024-10-11 13:19:29,735 INFO L87 Difference]: Start difference. First operand 456 states and 626 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:30,045 INFO L93 Difference]: Finished difference Result 1131 states and 1546 transitions. [2024-10-11 13:19:30,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:30,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-11 13:19:30,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:30,050 INFO L225 Difference]: With dead ends: 1131 [2024-10-11 13:19:30,050 INFO L226 Difference]: Without dead ends: 804 [2024-10-11 13:19:30,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2024-10-11 13:19:30,052 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 66 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:30,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 602 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:19:30,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-10-11 13:19:30,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 801. [2024-10-11 13:19:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 709 states have (on average 1.3328631875881523) internal successors, (945), 716 states have internal predecessors, (945), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 13:19:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1089 transitions. [2024-10-11 13:19:30,091 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1089 transitions. Word has length 142 [2024-10-11 13:19:30,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:30,092 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1089 transitions. [2024-10-11 13:19:30,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1089 transitions. [2024-10-11 13:19:30,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 13:19:30,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:30,094 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:30,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 13:19:30,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/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-11 13:19:30,295 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:30,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:30,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1169707315, now seen corresponding path program 1 times [2024-10-11 13:19:30,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:30,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785187034] [2024-10-11 13:19:30,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:30,296 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-11 13:19:30,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:30,298 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/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-11 13:19:30,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:30,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:19:30,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-11 13:19:30,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:19:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:30,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:30,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785187034] [2024-10-11 13:19:30,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785187034] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:19:30,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:19:30,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-10-11 13:19:30,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948166172] [2024-10-11 13:19:30,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:30,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:30,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:30,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:30,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:19:30,772 INFO L87 Difference]: Start difference. First operand 801 states and 1089 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:30,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:30,883 INFO L93 Difference]: Finished difference Result 1569 states and 2119 transitions. [2024-10-11 13:19:30,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:19:30,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-11 13:19:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:30,888 INFO L225 Difference]: With dead ends: 1569 [2024-10-11 13:19:30,889 INFO L226 Difference]: Without dead ends: 926 [2024-10-11 13:19:30,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:19:30,892 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 65 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:30,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 516 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:19:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-11 13:19:30,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 817. [2024-10-11 13:19:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 725 states have (on average 1.322758620689655) internal successors, (959), 732 states have internal predecessors, (959), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 13:19:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1103 transitions. [2024-10-11 13:19:30,934 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1103 transitions. Word has length 142 [2024-10-11 13:19:30,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:30,935 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1103 transitions. [2024-10-11 13:19:30,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:30,935 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1103 transitions. [2024-10-11 13:19:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 13:19:30,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:30,937 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:30,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:31,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/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-11 13:19:31,139 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:31,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:31,139 INFO L85 PathProgramCache]: Analyzing trace with hash 352058865, now seen corresponding path program 1 times [2024-10-11 13:19:31,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:31,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336648498] [2024-10-11 13:19:31,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:31,140 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-11 13:19:31,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:31,143 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/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-11 13:19:31,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:31,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:19:31,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-11 13:19:31,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:19:31,642 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:31,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:31,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336648498] [2024-10-11 13:19:31,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336648498] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:19:31,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:19:31,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-10-11 13:19:31,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007231013] [2024-10-11 13:19:31,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:31,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:31,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:31,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:31,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:19:31,643 INFO L87 Difference]: Start difference. First operand 817 states and 1103 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:31,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:31,770 INFO L93 Difference]: Finished difference Result 1537 states and 2065 transitions. [2024-10-11 13:19:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:31,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-11 13:19:31,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:31,775 INFO L225 Difference]: With dead ends: 1537 [2024-10-11 13:19:31,775 INFO L226 Difference]: Without dead ends: 914 [2024-10-11 13:19:31,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:19:31,778 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 48 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:31,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 521 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:19:31,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2024-10-11 13:19:31,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 803. [2024-10-11 13:19:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 711 states have (on average 1.3178621659634318) internal successors, (937), 718 states have internal predecessors, (937), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 13:19:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1081 transitions. [2024-10-11 13:19:31,821 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1081 transitions. Word has length 142 [2024-10-11 13:19:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:31,822 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1081 transitions. [2024-10-11 13:19:31,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1081 transitions. [2024-10-11 13:19:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 13:19:31,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:31,824 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:31,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:19:32,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/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-11 13:19:32,025 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:32,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:32,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1381921610, now seen corresponding path program 1 times [2024-10-11 13:19:32,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:32,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731052652] [2024-10-11 13:19:32,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:32,026 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-11 13:19:32,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:32,027 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/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-11 13:19:32,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:19:32,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:32,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:19:32,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:32,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731052652] [2024-10-11 13:19:32,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731052652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:32,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:32,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:19:32,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647259470] [2024-10-11 13:19:32,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:32,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:32,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:32,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:32,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:32,229 INFO L87 Difference]: Start difference. First operand 803 states and 1081 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:32,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:32,365 INFO L93 Difference]: Finished difference Result 1546 states and 2072 transitions. [2024-10-11 13:19:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:32,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2024-10-11 13:19:32,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:32,371 INFO L225 Difference]: With dead ends: 1546 [2024-10-11 13:19:32,372 INFO L226 Difference]: Without dead ends: 937 [2024-10-11 13:19:32,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:19:32,373 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 66 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:32,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 779 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:19:32,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-10-11 13:19:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 825. [2024-10-11 13:19:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 733 states have (on average 1.311050477489768) internal successors, (961), 740 states have internal predecessors, (961), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 13:19:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1105 transitions. [2024-10-11 13:19:32,413 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1105 transitions. Word has length 143 [2024-10-11 13:19:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:32,413 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1105 transitions. [2024-10-11 13:19:32,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:32,413 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1105 transitions. [2024-10-11 13:19:32,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 13:19:32,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:32,415 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:32,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:19:32,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/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-11 13:19:32,616 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:32,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:32,617 INFO L85 PathProgramCache]: Analyzing trace with hash -680857032, now seen corresponding path program 1 times [2024-10-11 13:19:32,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:32,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596538552] [2024-10-11 13:19:32,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:32,617 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-11 13:19:32,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:32,621 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/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-11 13:19:32,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:19:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:32,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:19:32,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:32,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:19:32,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:32,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596538552] [2024-10-11 13:19:32,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596538552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:19:32,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:19:32,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:19:32,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243380077] [2024-10-11 13:19:32,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:32,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:19:32,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:32,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:19:32,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:32,812 INFO L87 Difference]: Start difference. First operand 825 states and 1105 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:32,901 INFO L93 Difference]: Finished difference Result 1472 states and 1975 transitions. [2024-10-11 13:19:32,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:19:32,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2024-10-11 13:19:32,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:32,906 INFO L225 Difference]: With dead ends: 1472 [2024-10-11 13:19:32,906 INFO L226 Difference]: Without dead ends: 849 [2024-10-11 13:19:32,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:19:32,908 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:32,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 607 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:19:32,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-10-11 13:19:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 843. [2024-10-11 13:19:32,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 751 states have (on average 1.303595206391478) internal successors, (979), 758 states have internal predecessors, (979), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 13:19:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1123 transitions. [2024-10-11 13:19:32,960 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1123 transitions. Word has length 143 [2024-10-11 13:19:32,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:32,960 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1123 transitions. [2024-10-11 13:19:32,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:32,961 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1123 transitions. [2024-10-11 13:19:32,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 13:19:32,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:32,962 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:32,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:19:33,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/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-11 13:19:33,163 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:33,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:33,164 INFO L85 PathProgramCache]: Analyzing trace with hash 946970331, now seen corresponding path program 1 times [2024-10-11 13:19:33,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:33,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329711137] [2024-10-11 13:19:33,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:33,164 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-11 13:19:33,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:33,165 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/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-11 13:19:33,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (20)] Waiting until timeout for monitored process [2024-10-11 13:19:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:33,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-11 13:19:33,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:33,429 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-11 13:19:33,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-10-11 13:19:33,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:33,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-10-11 13:19:33,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:33,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-10-11 13:19:33,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2024-10-11 13:19:34,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 49 [2024-10-11 13:19:35,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:35,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 100 [2024-10-11 13:19:35,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:35,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 144 treesize of output 111 [2024-10-11 13:19:35,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:35,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 168 treesize of output 74 [2024-10-11 13:19:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 465 proven. 21 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-11 13:19:38,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:19:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:39,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:39,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329711137] [2024-10-11 13:19:39,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329711137] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:19:39,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:19:39,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [31] total 37 [2024-10-11 13:19:39,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321765299] [2024-10-11 13:19:39,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:39,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:19:39,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:39,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:19:39,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 13:19:39,426 INFO L87 Difference]: Start difference. First operand 843 states and 1123 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:40,386 INFO L93 Difference]: Finished difference Result 1867 states and 2486 transitions. [2024-10-11 13:19:40,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:19:40,387 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-11 13:19:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:40,392 INFO L225 Difference]: With dead ends: 1867 [2024-10-11 13:19:40,393 INFO L226 Difference]: Without dead ends: 1226 [2024-10-11 13:19:40,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=248, Invalid=1312, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 13:19:40,396 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 65 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:40,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 724 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:19:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2024-10-11 13:19:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1066. [2024-10-11 13:19:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 974 states have (on average 1.320328542094456) internal successors, (1286), 981 states have internal predecessors, (1286), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 13:19:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1430 transitions. [2024-10-11 13:19:40,460 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1430 transitions. Word has length 144 [2024-10-11 13:19:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:40,461 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1430 transitions. [2024-10-11 13:19:40,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1430 transitions. [2024-10-11 13:19:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 13:19:40,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:40,463 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:40,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (20)] Forceful destruction successful, exit code 0 [2024-10-11 13:19:40,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/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-11 13:19:40,664 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:40,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash 553943321, now seen corresponding path program 1 times [2024-10-11 13:19:40,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:40,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400107191] [2024-10-11 13:19:40,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:40,665 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-11 13:19:40,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:40,666 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/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-11 13:19:40,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (21)] Waiting until timeout for monitored process [2024-10-11 13:19:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:40,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 13:19:40,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:40,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:19:40,977 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 26 treesize of output 25 [2024-10-11 13:19:41,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:41,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-11 13:19:41,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:41,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-10-11 13:19:41,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:41,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-10-11 13:19:41,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:41,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 89 treesize of output 88 [2024-10-11 13:19:41,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:41,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 117 treesize of output 116 [2024-10-11 13:19:42,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:42,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 123 treesize of output 53 [2024-10-11 13:19:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 433 proven. 27 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-11 13:19:42,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:19:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:42,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:42,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400107191] [2024-10-11 13:19:42,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400107191] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:19:42,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:19:42,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-10-11 13:19:42,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186752181] [2024-10-11 13:19:42,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:42,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:42,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:42,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:42,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:19:42,474 INFO L87 Difference]: Start difference. First operand 1066 states and 1430 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:42,697 INFO L93 Difference]: Finished difference Result 2298 states and 3070 transitions. [2024-10-11 13:19:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:19:42,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-11 13:19:42,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:42,705 INFO L225 Difference]: With dead ends: 2298 [2024-10-11 13:19:42,706 INFO L226 Difference]: Without dead ends: 1505 [2024-10-11 13:19:42,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:19:42,709 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 118 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:42,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 289 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:19:42,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-11 13:19:42,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1378. [2024-10-11 13:19:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1268 states have (on average 1.3178233438485805) internal successors, (1671), 1277 states have internal predecessors, (1671), 84 states have call successors, (84), 25 states have call predecessors, (84), 25 states have return successors, (84), 75 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-11 13:19:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1839 transitions. [2024-10-11 13:19:42,770 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1839 transitions. Word has length 144 [2024-10-11 13:19:42,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:42,771 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1839 transitions. [2024-10-11 13:19:42,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1839 transitions. [2024-10-11 13:19:42,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 13:19:42,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:42,773 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:42,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (21)] Ended with exit code 0 [2024-10-11 13:19:42,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/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-11 13:19:42,974 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:42,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:42,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1268734097, now seen corresponding path program 1 times [2024-10-11 13:19:42,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:42,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002864829] [2024-10-11 13:19:42,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:42,975 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-11 13:19:42,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:42,978 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/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-11 13:19:42,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (22)] Waiting until timeout for monitored process [2024-10-11 13:19:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:43,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-11 13:19:43,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:43,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:19:43,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-10-11 13:19:43,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:43,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2024-10-11 13:19:43,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:43,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2024-10-11 13:19:43,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2024-10-11 13:19:44,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2024-10-11 13:19:46,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:46,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 152 treesize of output 111 [2024-10-11 13:19:48,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:48,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 165 treesize of output 129 [2024-10-11 13:19:48,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:48,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 157 treesize of output 75 [2024-10-11 13:19:49,298 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 513 proven. 21 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-11 13:19:49,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:19:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:50,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:50,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002864829] [2024-10-11 13:19:50,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002864829] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:19:50,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:19:50,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [34] total 40 [2024-10-11 13:19:50,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646301894] [2024-10-11 13:19:50,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:50,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:19:50,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:50,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:19:50,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1263, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 13:19:50,186 INFO L87 Difference]: Start difference. First operand 1378 states and 1839 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:51,031 INFO L93 Difference]: Finished difference Result 2535 states and 3375 transitions. [2024-10-11 13:19:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:19:51,032 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-11 13:19:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:51,039 INFO L225 Difference]: With dead ends: 2535 [2024-10-11 13:19:51,039 INFO L226 Difference]: Without dead ends: 1505 [2024-10-11 13:19:51,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=323, Invalid=1483, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 13:19:51,042 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 156 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:51,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 717 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:19:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-11 13:19:51,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1361. [2024-10-11 13:19:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1250 states have (on average 1.3152) internal successors, (1644), 1259 states have internal predecessors, (1644), 84 states have call successors, (84), 26 states have call predecessors, (84), 26 states have return successors, (84), 75 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-11 13:19:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1812 transitions. [2024-10-11 13:19:51,127 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1812 transitions. Word has length 144 [2024-10-11 13:19:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:51,127 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 1812 transitions. [2024-10-11 13:19:51,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1812 transitions. [2024-10-11 13:19:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 13:19:51,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:51,129 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:51,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (22)] Forceful destruction successful, exit code 0 [2024-10-11 13:19:51,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/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-11 13:19:51,330 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:51,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash 969602585, now seen corresponding path program 1 times [2024-10-11 13:19:51,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:51,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54337552] [2024-10-11 13:19:51,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:51,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:19:51,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:51,332 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/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-11 13:19:51,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (23)] Waiting until timeout for monitored process [2024-10-11 13:19:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:51,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 13:19:51,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:51,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:19:51,634 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 26 treesize of output 25 [2024-10-11 13:19:51,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:51,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-11 13:19:51,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:51,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-11 13:19:51,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:51,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-10-11 13:19:52,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:52,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 75 [2024-10-11 13:19:52,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:52,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 107 treesize of output 103 [2024-10-11 13:19:52,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:52,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 108 treesize of output 50 [2024-10-11 13:19:52,856 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 433 proven. 27 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-11 13:19:52,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:19:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:19:53,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:19:53,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54337552] [2024-10-11 13:19:53,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54337552] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:19:53,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:19:53,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-10-11 13:19:53,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023979492] [2024-10-11 13:19:53,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:19:53,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:19:53,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:19:53,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:19:53,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:19:53,037 INFO L87 Difference]: Start difference. First operand 1361 states and 1812 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:19:53,292 INFO L93 Difference]: Finished difference Result 2445 states and 3255 transitions. [2024-10-11 13:19:53,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:19:53,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-11 13:19:53,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:19:53,298 INFO L225 Difference]: With dead ends: 2445 [2024-10-11 13:19:53,298 INFO L226 Difference]: Without dead ends: 1436 [2024-10-11 13:19:53,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:19:53,300 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 67 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:19:53,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 525 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:19:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2024-10-11 13:19:53,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1251. [2024-10-11 13:19:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1169 states have (on average 1.3233532934131738) internal successors, (1547), 1174 states have internal predecessors, (1547), 62 states have call successors, (62), 19 states have call predecessors, (62), 19 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-11 13:19:53,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1671 transitions. [2024-10-11 13:19:53,357 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1671 transitions. Word has length 144 [2024-10-11 13:19:53,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:19:53,358 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 1671 transitions. [2024-10-11 13:19:53,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:19:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1671 transitions. [2024-10-11 13:19:53,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 13:19:53,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:19:53,360 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:19:53,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (23)] Ended with exit code 0 [2024-10-11 13:19:53,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-clean/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-11 13:19:53,560 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:19:53,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:19:53,561 INFO L85 PathProgramCache]: Analyzing trace with hash 576575575, now seen corresponding path program 1 times [2024-10-11 13:19:53,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:19:53,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485941006] [2024-10-11 13:19:53,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:19:53,561 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-11 13:19:53,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:19:53,562 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/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-11 13:19:53,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (24)] Waiting until timeout for monitored process [2024-10-11 13:19:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:19:53,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-11 13:19:53,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:53,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:19:54,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-10-11 13:19:54,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:54,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 31 [2024-10-11 13:19:54,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:54,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2024-10-11 13:19:54,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2024-10-11 13:19:55,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 63 [2024-10-11 13:19:56,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:56,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 157 treesize of output 118 [2024-10-11 13:19:57,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:57,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 163 treesize of output 129 [2024-10-11 13:19:58,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:19:58,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 183 treesize of output 85 [2024-10-11 13:20:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 500 proven. 33 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-10-11 13:20:07,691 INFO L311 TraceCheckSpWp]: Computing backward predicates...