./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-s_file-16.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-s_file-16.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 d6d1133c9c30821e735c948d3959f88a96057a51cd0531437d4f6aabe9fe7ffd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:45:37,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:45:37,104 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:45:37,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:45:37,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:45:37,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:45:37,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:45:37,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:45:37,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:45:37,148 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:45:37,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:45:37,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:45:37,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:45:37,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:45:37,150 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:45:37,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:45:37,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:45:37,151 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:45:37,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:45:37,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:45:37,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:45:37,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:45:37,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:45:37,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:45:37,154 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:45:37,154 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:45:37,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:45:37,155 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:45:37,155 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:45:37,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:45:37,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:45:37,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:45:37,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:45:37,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:45:37,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:45:37,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:45:37,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:45:37,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:45:37,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:45:37,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:45:37,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:45:37,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:45:37,160 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 -> d6d1133c9c30821e735c948d3959f88a96057a51cd0531437d4f6aabe9fe7ffd [2024-10-11 13:45:37,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:45:37,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:45:37,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:45:37,434 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:45:37,434 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:45:37,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-16.i [2024-10-11 13:45:38,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:45:39,106 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:45:39,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-16.i [2024-10-11 13:45:39,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c1bd4a7e8/bd3a23ed612c49cd8d0def0ca3b95fcb/FLAG33ebe6f91 [2024-10-11 13:45:39,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c1bd4a7e8/bd3a23ed612c49cd8d0def0ca3b95fcb [2024-10-11 13:45:39,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:45:39,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:45:39,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:45:39,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:45:39,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:45:39,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:45:39" (1/1) ... [2024-10-11 13:45:39,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cda7091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:39, skipping insertion in model container [2024-10-11 13:45:39,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:45:39" (1/1) ... [2024-10-11 13:45:39,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:45:39,688 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-s_file-16.i[916,929] [2024-10-11 13:45:39,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:45:39,752 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:45:39,761 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-s_file-16.i[916,929] [2024-10-11 13:45:39,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:45:39,851 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:45:39,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:39 WrapperNode [2024-10-11 13:45:39,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:45:39,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:45:39,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:45:39,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:45:39,859 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:45:39" (1/1) ... [2024-10-11 13:45:39,871 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:45:39" (1/1) ... [2024-10-11 13:45:39,909 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462 [2024-10-11 13:45:39,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:45:39,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:45:39,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:45:39,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:45:39,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:39" (1/1) ... [2024-10-11 13:45:39,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:39" (1/1) ... [2024-10-11 13:45:39,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:39" (1/1) ... [2024-10-11 13:45:39,948 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 17 writes are split as follows [0, 17]. [2024-10-11 13:45:39,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:39" (1/1) ... [2024-10-11 13:45:39,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:39" (1/1) ... [2024-10-11 13:45:39,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:39" (1/1) ... [2024-10-11 13:45:39,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:39" (1/1) ... [2024-10-11 13:45:39,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:39" (1/1) ... [2024-10-11 13:45:39,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:39" (1/1) ... [2024-10-11 13:45:39,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:45:39,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:45:39,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:45:39,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:45:39,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:39" (1/1) ... [2024-10-11 13:45:40,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:45:40,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:45:40,027 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:45:40,032 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:45:40,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:45:40,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:45:40,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:45:40,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:45:40,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:45:40,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:45:40,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:45:40,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:45:40,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:45:40,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:45:40,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:45:40,087 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:45:40,087 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:45:40,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:45:40,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:45:40,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:45:40,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:45:40,236 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:45:40,238 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:45:40,744 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-10-11 13:45:40,744 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:45:40,781 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:45:40,781 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:45:40,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:45:40 BoogieIcfgContainer [2024-10-11 13:45:40,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:45:40,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:45:40,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:45:40,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:45:40,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:45:39" (1/3) ... [2024-10-11 13:45:40,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dc85d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:45:40, skipping insertion in model container [2024-10-11 13:45:40,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:39" (2/3) ... [2024-10-11 13:45:40,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dc85d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:45:40, skipping insertion in model container [2024-10-11 13:45:40,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:45:40" (3/3) ... [2024-10-11 13:45:40,792 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-16.i [2024-10-11 13:45:40,809 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:45:40,810 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:45:40,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:45:40,886 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;@58db6fb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:45:40,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:45:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 80 states have internal predecessors, (113), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:45:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:45:40,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:40,909 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:40,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:40,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:40,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2031717272, now seen corresponding path program 1 times [2024-10-11 13:45:40,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:45:40,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822923274] [2024-10-11 13:45:40,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:40,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:45:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:45:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:45:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:45:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:45:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:45:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:45:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:45:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:45:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:45:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:45:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:45:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:45:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:45:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:45:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:45:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:45:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:45:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:45:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:45:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:45:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:45:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:45:41,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:45:41,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822923274] [2024-10-11 13:45:41,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822923274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:45:41,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:45:41,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:45:41,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886545484] [2024-10-11 13:45:41,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:41,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:45:41,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:45:41,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:45:41,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:45:41,367 INFO L87 Difference]: Start difference. First operand has 103 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 80 states have internal predecessors, (113), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:45:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:41,433 INFO L93 Difference]: Finished difference Result 203 states and 329 transitions. [2024-10-11 13:45:41,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:45:41,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 152 [2024-10-11 13:45:41,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:41,444 INFO L225 Difference]: With dead ends: 203 [2024-10-11 13:45:41,445 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 13:45:41,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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:45:41,454 INFO L432 NwaCegarLoop]: 146 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, 146 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:45:41,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:45:41,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 13:45:41,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 13:45:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:45:41,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2024-10-11 13:45:41,514 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 152 [2024-10-11 13:45:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:41,516 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2024-10-11 13:45:41,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:45:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2024-10-11 13:45:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:45:41,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:41,521 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:41,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:45:41,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:41,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:41,522 INFO L85 PathProgramCache]: Analyzing trace with hash -865443006, now seen corresponding path program 1 times [2024-10-11 13:45:41,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:45:41,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388685895] [2024-10-11 13:45:41,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:41,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:45:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:45:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:45:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:45:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:45:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:45:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:45:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:45:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:45:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:45:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:45:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:45:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:45:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:45:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:45:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:45:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:45:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:45:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:45:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:45:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:45:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:45:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:45:41,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:45:41,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388685895] [2024-10-11 13:45:41,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388685895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:45:41,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:45:41,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:45:41,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400869057] [2024-10-11 13:45:41,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:41,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:45:41,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:45:41,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:45:41,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:45:41,936 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:45:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:42,041 INFO L93 Difference]: Finished difference Result 203 states and 302 transitions. [2024-10-11 13:45:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:45:42,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 152 [2024-10-11 13:45:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:42,044 INFO L225 Difference]: With dead ends: 203 [2024-10-11 13:45:42,044 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 13:45:42,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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:45:42,049 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:42,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:45:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 13:45:42,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-11 13:45:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:45:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-10-11 13:45:42,066 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 152 [2024-10-11 13:45:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:42,067 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-10-11 13:45:42,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:45:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-10-11 13:45:42,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:45:42,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:42,071 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:42,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:45:42,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:42,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:42,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1552461060, now seen corresponding path program 1 times [2024-10-11 13:45:42,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:45:42,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112822954] [2024-10-11 13:45:42,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:42,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:45:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:45:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:45:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:45:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:45:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:45:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:45:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:45:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:45:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:45:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:45:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:45:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:45:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:45:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:45:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:45:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:45:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:45:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:45:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:45:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:45:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:45:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:45:44,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:45:44,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112822954] [2024-10-11 13:45:44,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112822954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:45:44,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:45:44,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:45:44,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754348601] [2024-10-11 13:45:44,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:44,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:45:44,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:45:44,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:45:44,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:45:44,315 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:45:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:44,669 INFO L93 Difference]: Finished difference Result 248 states and 368 transitions. [2024-10-11 13:45:44,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:45:44,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 152 [2024-10-11 13:45:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:44,672 INFO L225 Difference]: With dead ends: 248 [2024-10-11 13:45:44,672 INFO L226 Difference]: Without dead ends: 146 [2024-10-11 13:45:44,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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:45:44,674 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 53 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:44,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 358 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:45:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-11 13:45:44,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 117. [2024-10-11 13:45:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:45:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 174 transitions. [2024-10-11 13:45:44,705 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 174 transitions. Word has length 152 [2024-10-11 13:45:44,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:44,705 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 174 transitions. [2024-10-11 13:45:44,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:45:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 174 transitions. [2024-10-11 13:45:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:45:44,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:44,713 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:44,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:45:44,713 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:44,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:44,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2041441658, now seen corresponding path program 1 times [2024-10-11 13:45:44,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:45:44,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126708086] [2024-10-11 13:45:44,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:44,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:45:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:45:44,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328394768] [2024-10-11 13:45:44,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:44,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:45:44,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:45:44,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:45:44,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:45:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:45:45,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:45:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:45:45,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:45:45,623 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:45:45,624 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:45:45,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:45:45,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:45:45,829 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 13:45:45,912 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:45:45,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:45:45 BoogieIcfgContainer [2024-10-11 13:45:45,915 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:45:45,916 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:45:45,916 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:45:45,916 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:45:45,918 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:45:40" (3/4) ... [2024-10-11 13:45:45,921 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:45:45,922 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:45:45,924 INFO L158 Benchmark]: Toolchain (without parser) took 6424.83ms. Allocated memory was 134.2MB in the beginning and 226.5MB in the end (delta: 92.3MB). Free memory was 85.0MB in the beginning and 129.4MB in the end (delta: -44.4MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2024-10-11 13:45:45,926 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory was 95.1MB in the beginning and 94.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:45:45,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.21ms. Allocated memory is still 134.2MB. Free memory was 84.6MB in the beginning and 67.2MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 13:45:45,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.00ms. Allocated memory is still 134.2MB. Free memory was 67.2MB in the beginning and 63.5MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:45:45,927 INFO L158 Benchmark]: Boogie Preprocessor took 81.61ms. Allocated memory is still 134.2MB. Free memory was 63.5MB in the beginning and 59.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:45:45,927 INFO L158 Benchmark]: RCFGBuilder took 788.73ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 58.9MB in the beginning and 132.8MB in the end (delta: -73.9MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-10-11 13:45:45,927 INFO L158 Benchmark]: TraceAbstraction took 5130.90ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 132.8MB in the beginning and 129.4MB in the end (delta: 3.4MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2024-10-11 13:45:45,928 INFO L158 Benchmark]: Witness Printer took 6.16ms. Allocated memory is still 226.5MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:45:45,930 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.16ms. Allocated memory is still 134.2MB. Free memory was 95.1MB in the beginning and 94.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.21ms. Allocated memory is still 134.2MB. Free memory was 84.6MB in the beginning and 67.2MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.00ms. Allocated memory is still 134.2MB. Free memory was 67.2MB in the beginning and 63.5MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.61ms. Allocated memory is still 134.2MB. Free memory was 63.5MB in the beginning and 59.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 788.73ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 58.9MB in the beginning and 132.8MB in the end (delta: -73.9MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5130.90ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 132.8MB in the beginning and 129.4MB in the end (delta: 3.4MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * Witness Printer took 6.16ms. Allocated memory is still 226.5MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 64. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 4, 256, 0, 1, 1000000.8, 3.8, 25, 2.75, 0, 32, 2, 2, -32 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 4, 256, 0, 1, 1000000.8, 3.8, 25, 2.75, 0, 32, 2, 2, -32 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 4, 256, 0, 1, 1000000.8, 3.8, 25, 2.75, 0, 32, 2, 2, -32 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 4, 256, 0, 1, 1000000.8, 3.8, 25, 2.75, 0, 32, 2, 2, -32 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 4, 256, 0, 1, 1000000.8, 3.8, 25, 2.75, 0, 32, 2, 2, -32 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 4, 256, 0, 1, 1000000.8, 3.8, 25, 2.75, 0, 32, 2, 2, -32 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 4, 256, 0, 1, 1000000.8, 3.8, 25, 2.75, 0, 32, 2, 2, -32 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 4, 256, 0, 1, 1000000.8, 3.8, 25, 2.75, 0, 32, 2, 2, -32 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 4, 256, 0, 1, 1000000.8, 3.8, 25, 2.75, 0, 32, 2, 2, -32 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 4, 256, 0, 1, 1000000.8, 3.8, 25, 2.75, 0, 32, 2, 2, -32 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 4, 256, 0, 1, 1000000.8, 3.8, 25, 2.75, 0, 32, 2, 2, -32 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 4, 256, 0, 1, 1000000.8, 3.8, 25, 2.75, 0, 32, 2, 2, -32 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 4, 256, 0, 1, 1000000.8, 3.8, 25, 2.75, 0, 32, 2, 2, -32 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 4, 256, 0, 1, 1000000.8, 3.8, 25, 2.75, 0, 32, 2, 2, -32 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 4, 256, 0, 1, 1000000.8, 3.8, 25, 2.75, 0, 32, 2, 2, -32 }; [L55] signed char last_1_WrapperStruct00_var_1_9 = 25; [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L119] EXPR WrapperStruct00.var_1_9 [L119] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L129] RET updateLastVariables() [L130] CALL updateVariables() [L86] WrapperStruct00.var_1_3 = __VERIFIER_nondet_short() [L87] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= -32768) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= -32768) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L88] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L89] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_3 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_3 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L90] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -32768) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -32768) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L93] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L94] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L96] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L97] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L100] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L101] EXPR WrapperStruct00.var_1_8 [L101] EXPR WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L101] EXPR WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_8 [L101] EXPR WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L101] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L101] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L102] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L103] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L103] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L103] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L104] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_10 != 0.0F) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_10 != 0.0F) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L105] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L106] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L107] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L108] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L109] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 31) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L110] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L111] WrapperStruct00.var_1_13 = __VERIFIER_nondet_char() [L112] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 31) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L114] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L115] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L130] RET updateVariables() [L131] CALL step() [L59] EXPR WrapperStruct00.var_1_3 [L59] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L59] EXPR ((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) [L59] EXPR WrapperStruct00.var_1_4 [L59] EXPR ((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L59] COND FALSE !((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) [L62] EXPR WrapperStruct00.var_1_8 [L62] WrapperStruct00.var_1_7 = WrapperStruct00.var_1_8 [L63] EXPR WrapperStruct00.var_1_11 [L63] signed char stepLocal_2 = WrapperStruct00.var_1_11; [L64] EXPR WrapperStruct00.var_1_10 [L64] unsigned char stepLocal_1 = 99999.375 <= WrapperStruct00.var_1_10; [L65] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L65] COND FALSE !(WrapperStruct00.var_1_13 <= stepLocal_2) [L70] WrapperStruct00.var_1_15 = -25 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L72] EXPR WrapperStruct00.var_1_6 [L72] unsigned char stepLocal_0 = WrapperStruct00.var_1_6; [L73] EXPR WrapperStruct00.var_1_8 [L73] EXPR WrapperStruct00.var_1_7 [L73] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L73] COND FALSE !(WrapperStruct00.var_1_8 < (WrapperStruct00.var_1_7 / WrapperStruct00.var_1_10)) [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR WrapperStruct00.var_1_3 [L122] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L122] EXPR ((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) [L122] EXPR WrapperStruct00.var_1_4 [L122] EXPR ((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L122] EXPR ((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))) : 1 [L122] EXPR ((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L122] EXPR (((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))) : 1) && (WrapperStruct00.var_1_7 == ((float) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L122] EXPR (((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))) : 1) && (WrapperStruct00.var_1_7 == ((float) WrapperStruct00.var_1_8)) [L122] EXPR WrapperStruct00.var_1_7 [L122] EXPR WrapperStruct00.var_1_8 [L122] EXPR (((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))) : 1) && (WrapperStruct00.var_1_7 == ((float) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L122] EXPR ((((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))) : 1) && (WrapperStruct00.var_1_7 == ((float) WrapperStruct00.var_1_8))) && ((WrapperStruct00.var_1_8 < (WrapperStruct00.var_1_7 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_1 || WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_9 == ((signed char) ((((((WrapperStruct00.var_1_11) > (5)) ? (WrapperStruct00.var_1_11) : (5))) + (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_14))) : ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_9 == ((signed char) WrapperStruct00.var_1_11)) : (WrapperStruct00.var_1_9 == ((signed char) WrapperStruct00.var_1_12)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L122] EXPR ((((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))) : 1) && (WrapperStruct00.var_1_7 == ((float) WrapperStruct00.var_1_8))) && ((WrapperStruct00.var_1_8 < (WrapperStruct00.var_1_7 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_1 || WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_9 == ((signed char) ((((((WrapperStruct00.var_1_11) > (5)) ? (WrapperStruct00.var_1_11) : (5))) + (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_14))) : ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_9 == ((signed char) WrapperStruct00.var_1_11)) : (WrapperStruct00.var_1_9 == ((signed char) WrapperStruct00.var_1_12)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L122] EXPR (((((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))) : 1) && (WrapperStruct00.var_1_7 == ((float) WrapperStruct00.var_1_8))) && ((WrapperStruct00.var_1_8 < (WrapperStruct00.var_1_7 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_1 || WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_9 == ((signed char) ((((((WrapperStruct00.var_1_11) > (5)) ? (WrapperStruct00.var_1_11) : (5))) + (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_14))) : ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_9 == ((signed char) WrapperStruct00.var_1_11)) : (WrapperStruct00.var_1_9 == ((signed char) WrapperStruct00.var_1_12)))) : 1)) && ((WrapperStruct00.var_1_13 <= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_7) && (99999.375 <= WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_15 == ((signed short int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_15 == ((signed short int) -25))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L122] EXPR (((((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))) : 1) && (WrapperStruct00.var_1_7 == ((float) WrapperStruct00.var_1_8))) && ((WrapperStruct00.var_1_8 < (WrapperStruct00.var_1_7 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_1 || WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_9 == ((signed char) ((((((WrapperStruct00.var_1_11) > (5)) ? (WrapperStruct00.var_1_11) : (5))) + (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_14))) : ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_9 == ((signed char) WrapperStruct00.var_1_11)) : (WrapperStruct00.var_1_9 == ((signed char) WrapperStruct00.var_1_12)))) : 1)) && ((WrapperStruct00.var_1_13 <= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_7) && (99999.375 <= WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_15 == ((signed short int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_15 == ((signed short int) -25))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L122-L123] return (((((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))) : 1) && (WrapperStruct00.var_1_7 == ((float) WrapperStruct00.var_1_8))) && ((WrapperStruct00.var_1_8 < (WrapperStruct00.var_1_7 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_1 || WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_9 == ((signed char) ((((((WrapperStruct00.var_1_11) > (5)) ? (WrapperStruct00.var_1_11) : (5))) + (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_14))) : ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_9 == ((signed char) WrapperStruct00.var_1_11)) : (WrapperStruct00.var_1_9 == ((signed char) WrapperStruct00.var_1_12)))) : 1)) && ((WrapperStruct00.var_1_13 <= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_7) && (99999.375 <= WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_15 == ((signed short int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_15 == ((signed short int) -25))) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 4, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 929 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 529 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 267 IncrementalHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 400 mSDtfsCounter, 267 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=3, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 29 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 760 NumberOfCodeBlocks, 760 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 575 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2520/2520 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:45:45,963 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-s_file-16.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 d6d1133c9c30821e735c948d3959f88a96057a51cd0531437d4f6aabe9fe7ffd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:45:48,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:45:48,206 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:45:48,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:45:48,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:45:48,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:45:48,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:45:48,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:45:48,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:45:48,251 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:45:48,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:45:48,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:45:48,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:45:48,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:45:48,254 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:45:48,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:45:48,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:45:48,255 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:45:48,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:45:48,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:45:48,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:45:48,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:45:48,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:45:48,259 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:45:48,259 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:45:48,260 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:45:48,260 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:45:48,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:45:48,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:45:48,260 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:45:48,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:45:48,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:45:48,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:45:48,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:45:48,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:45:48,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:45:48,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:45:48,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:45:48,264 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:45:48,264 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:45:48,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:45:48,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:45:48,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:45:48,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:45:48,267 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:45:48,267 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 -> d6d1133c9c30821e735c948d3959f88a96057a51cd0531437d4f6aabe9fe7ffd [2024-10-11 13:45:48,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:45:48,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:45:48,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:45:48,605 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:45:48,605 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:45:48,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-16.i [2024-10-11 13:45:50,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:45:50,304 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:45:50,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-16.i [2024-10-11 13:45:50,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1253b4710/aab289b96d9648cca49ea9d9db7725d0/FLAG042acf8c6 [2024-10-11 13:45:50,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1253b4710/aab289b96d9648cca49ea9d9db7725d0 [2024-10-11 13:45:50,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:45:50,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:45:50,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:45:50,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:45:50,332 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:45:50,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:45:50" (1/1) ... [2024-10-11 13:45:50,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4227ec2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:50, skipping insertion in model container [2024-10-11 13:45:50,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:45:50" (1/1) ... [2024-10-11 13:45:50,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:45:50,545 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-s_file-16.i[916,929] [2024-10-11 13:45:50,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:45:50,641 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:45:50,653 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-s_file-16.i[916,929] [2024-10-11 13:45:50,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:45:50,742 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:45:50,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:50 WrapperNode [2024-10-11 13:45:50,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:45:50,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:45:50,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:45:50,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:45:50,751 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:45:50" (1/1) ... [2024-10-11 13:45:50,774 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:45:50" (1/1) ... [2024-10-11 13:45:50,820 INFO L138 Inliner]: procedures = 33, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 456 [2024-10-11 13:45:50,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:45:50,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:45:50,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:45:50,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:45:50,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:50" (1/1) ... [2024-10-11 13:45:50,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:50" (1/1) ... [2024-10-11 13:45:50,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:50" (1/1) ... [2024-10-11 13:45:50,873 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 17 writes are split as follows [0, 17]. [2024-10-11 13:45:50,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:50" (1/1) ... [2024-10-11 13:45:50,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:50" (1/1) ... [2024-10-11 13:45:50,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:50" (1/1) ... [2024-10-11 13:45:50,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:50" (1/1) ... [2024-10-11 13:45:50,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:50" (1/1) ... [2024-10-11 13:45:50,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:50" (1/1) ... [2024-10-11 13:45:50,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:45:50,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:45:50,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:45:50,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:45:50,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:50" (1/1) ... [2024-10-11 13:45:50,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:45:50,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:45:50,948 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:45:50,959 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:45:50,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:45:50,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:45:50,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:45:50,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:45:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:45:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:45:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:45:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:45:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:45:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:45:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:45:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:45:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:45:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:45:50,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:45:50,996 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:45:50,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:45:50,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:45:50,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:45:50,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:45:50,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:45:50,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:45:50,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:45:51,117 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:45:51,119 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:45:54,719 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2024-10-11 13:45:54,719 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:45:54,768 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:45:54,768 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:45:54,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:45:54 BoogieIcfgContainer [2024-10-11 13:45:54,769 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:45:54,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:45:54,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:45:54,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:45:54,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:45:50" (1/3) ... [2024-10-11 13:45:54,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e60ccec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:45:54, skipping insertion in model container [2024-10-11 13:45:54,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:50" (2/3) ... [2024-10-11 13:45:54,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e60ccec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:45:54, skipping insertion in model container [2024-10-11 13:45:54,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:45:54" (3/3) ... [2024-10-11 13:45:54,778 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-16.i [2024-10-11 13:45:54,794 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:45:54,794 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:45:54,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:45:54,857 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;@2ded04f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:45:54,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:45:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 80 states have internal predecessors, (113), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:45:54,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:45:54,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:54,876 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:54,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:54,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:54,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2031717272, now seen corresponding path program 1 times [2024-10-11 13:45:54,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:54,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916133457] [2024-10-11 13:45:54,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:54,901 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:45:54,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:54,902 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:45:54,904 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:45:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:55,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:45:55,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2024-10-11 13:45:55,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:45:55,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:55,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916133457] [2024-10-11 13:45:55,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916133457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:45:55,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:45:55,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:45:55,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099191328] [2024-10-11 13:45:55,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:55,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:45:55,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:55,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:45:55,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:45:55,458 INFO L87 Difference]: Start difference. First operand has 103 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 80 states have internal predecessors, (113), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:45:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:55,526 INFO L93 Difference]: Finished difference Result 199 states and 323 transitions. [2024-10-11 13:45:55,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:45:55,530 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 152 [2024-10-11 13:45:55,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:55,544 INFO L225 Difference]: With dead ends: 199 [2024-10-11 13:45:55,545 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 13:45:55,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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:45:55,552 INFO L432 NwaCegarLoop]: 138 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, 138 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:45:55,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:45:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 13:45:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-11 13:45:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 74 states have internal predecessors, (100), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:45:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2024-10-11 13:45:55,595 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 152 [2024-10-11 13:45:55,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:55,596 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2024-10-11 13:45:55,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:45:55,596 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2024-10-11 13:45:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:45:55,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:55,600 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:55,617 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:45:55,800 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:45:55,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:55,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:55,802 INFO L85 PathProgramCache]: Analyzing trace with hash -865443006, now seen corresponding path program 1 times [2024-10-11 13:45:55,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:55,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991270824] [2024-10-11 13:45:55,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:55,803 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:45:55,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:55,804 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:45:55,805 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:45:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:56,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:45:56,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-10-11 13:45:56,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:45:56,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:56,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991270824] [2024-10-11 13:45:56,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991270824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:45:56,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:45:56,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:45:56,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375808878] [2024-10-11 13:45:56,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:56,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:45:56,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:56,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:45:56,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:45:56,357 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:45:56,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:56,474 INFO L93 Difference]: Finished difference Result 195 states and 286 transitions. [2024-10-11 13:45:56,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:45:56,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 152 [2024-10-11 13:45:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:56,477 INFO L225 Difference]: With dead ends: 195 [2024-10-11 13:45:56,478 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 13:45:56,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 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:45:56,481 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:56,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 401 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:45:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 13:45:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 13:45:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 76 states have internal predecessors, (102), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:45:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 144 transitions. [2024-10-11 13:45:56,506 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 144 transitions. Word has length 152 [2024-10-11 13:45:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:56,508 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 144 transitions. [2024-10-11 13:45:56,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:45:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2024-10-11 13:45:56,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:45:56,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:56,510 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:56,533 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 (3)] Forceful destruction successful, exit code 0 [2024-10-11 13:45:56,718 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:45:56,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:56,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:56,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1552461060, now seen corresponding path program 1 times [2024-10-11 13:45:56,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:56,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770750503] [2024-10-11 13:45:56,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:56,721 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:45:56,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:56,722 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:45:56,724 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:45:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:57,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 13:45:57,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:57,675 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:45:58,085 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 80 treesize of output 34 [2024-10-11 13:45:58,338 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 80 treesize of output 34 [2024-10-11 13:45:58,506 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 80 treesize of output 34 [2024-10-11 13:45:58,672 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 75 treesize of output 44 [2024-10-11 13:45:59,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:45:59,085 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 85 treesize of output 57 [2024-10-11 13:45:59,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:45:59,682 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 151 treesize of output 93 [2024-10-11 13:45:59,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:45:59,859 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 151 treesize of output 84 [2024-10-11 13:46:00,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:00,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 241 treesize of output 85 [2024-10-11 13:46:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 128 proven. 440 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-11 13:46:00,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:46:00,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:46:00,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770750503] [2024-10-11 13:46:00,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770750503] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:46:00,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [552361380] [2024-10-11 13:46:00,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:46:00,630 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:46:00,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:46:00,633 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:46:00,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-11 13:46:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:46:02,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-11 13:46:02,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:46:03,267 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:46:04,086 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 64 treesize of output 32 [2024-10-11 13:46:05,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:05,364 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 1 case distinctions, treesize of input 109 treesize of output 71 [2024-10-11 13:46:06,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:06,166 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 3 case distinctions, treesize of input 117 treesize of output 82 [2024-10-11 13:46:07,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:07,102 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 6 case distinctions, treesize of input 128 treesize of output 85 [2024-10-11 13:46:07,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:07,743 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 6 case distinctions, treesize of input 128 treesize of output 85 [2024-10-11 13:46:08,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:08,410 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 6 case distinctions, treesize of input 167 treesize of output 112 [2024-10-11 13:46:08,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:08,725 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 10 case distinctions, treesize of input 167 treesize of output 107 [2024-10-11 13:46:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-11 13:46:09,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:46:09,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [552361380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:46:09,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:46:09,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11] total 24 [2024-10-11 13:46:09,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493669081] [2024-10-11 13:46:09,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:46:09,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 13:46:09,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:46:09,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 13:46:09,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2024-10-11 13:46:09,372 INFO L87 Difference]: Start difference. First operand 99 states and 144 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 5 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2024-10-11 13:46:19,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:46:21,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:46:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:46:24,036 INFO L93 Difference]: Finished difference Result 386 states and 554 transitions. [2024-10-11 13:46:24,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 13:46:24,037 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 5 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 152 [2024-10-11 13:46:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:46:24,040 INFO L225 Difference]: With dead ends: 386 [2024-10-11 13:46:24,040 INFO L226 Difference]: Without dead ends: 288 [2024-10-11 13:46:24,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2024-10-11 13:46:24,042 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 405 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:46:24,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 495 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 14.4s Time] [2024-10-11 13:46:24,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-11 13:46:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 282. [2024-10-11 13:46:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 213 states have (on average 1.323943661971831) internal successors, (282), 215 states have internal predecessors, (282), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-11 13:46:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 406 transitions. [2024-10-11 13:46:24,085 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 406 transitions. Word has length 152 [2024-10-11 13:46:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:46:24,086 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 406 transitions. [2024-10-11 13:46:24,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 5 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2024-10-11 13:46:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 406 transitions. [2024-10-11 13:46:24,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 13:46:24,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:46:24,092 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:24,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-10-11 13:46:24,309 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 (4)] Forceful destruction successful, exit code 0 [2024-10-11 13:46:24,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:46:24,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:46:24,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:46:24,494 INFO L85 PathProgramCache]: Analyzing trace with hash 494622982, now seen corresponding path program 1 times [2024-10-11 13:46:24,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:46:24,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933865850] [2024-10-11 13:46:24,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:46:24,495 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:46:24,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:46:24,499 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:46:24,500 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:46:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:46:24,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:46:24,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:46:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-10-11 13:46:24,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:46:24,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:46:24,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933865850] [2024-10-11 13:46:24,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933865850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:46:24,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:46:24,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:46:24,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294789567] [2024-10-11 13:46:24,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:46:24,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:46:24,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:46:24,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:46:24,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:46:24,935 INFO L87 Difference]: Start difference. First operand 282 states and 406 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:46:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:46:25,028 INFO L93 Difference]: Finished difference Result 565 states and 814 transitions. [2024-10-11 13:46:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:46:25,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 152 [2024-10-11 13:46:25,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:46:25,035 INFO L225 Difference]: With dead ends: 565 [2024-10-11 13:46:25,035 INFO L226 Difference]: Without dead ends: 284 [2024-10-11 13:46:25,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 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:46:25,037 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:46:25,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 404 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:46:25,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-11 13:46:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-10-11 13:46:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 215 states have (on average 1.3162790697674418) internal successors, (283), 217 states have internal predecessors, (283), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-11 13:46:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 407 transitions. [2024-10-11 13:46:25,071 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 407 transitions. Word has length 152 [2024-10-11 13:46:25,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:46:25,071 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 407 transitions. [2024-10-11 13:46:25,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:46:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 407 transitions. [2024-10-11 13:46:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 13:46:25,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:46:25,074 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:25,093 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 (6)] Forceful destruction successful, exit code 0 [2024-10-11 13:46:25,275 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:46:25,275 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:46:25,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:46:25,276 INFO L85 PathProgramCache]: Analyzing trace with hash 67296828, now seen corresponding path program 1 times [2024-10-11 13:46:25,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:46:25,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344408066] [2024-10-11 13:46:25,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:46:25,277 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:46:25,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:46:25,278 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:46:25,279 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:46:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:46:25,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:46:25,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:46:25,858 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 97 treesize of output 43 [2024-10-11 13:46:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 40 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-10-11 13:46:25,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:46:26,124 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 61 treesize of output 25 [2024-10-11 13:46:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-11 13:46:26,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:46:26,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344408066] [2024-10-11 13:46:26,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344408066] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:46:26,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:46:26,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-11 13:46:26,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928657066] [2024-10-11 13:46:26,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:46:26,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:46:26,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:46:26,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:46:26,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:46:26,175 INFO L87 Difference]: Start difference. First operand 284 states and 407 transitions. Second operand has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2024-10-11 13:46:31,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:46:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:46:32,008 INFO L93 Difference]: Finished difference Result 582 states and 830 transitions. [2024-10-11 13:46:32,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 13:46:32,027 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) Word has length 154 [2024-10-11 13:46:32,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:46:32,030 INFO L225 Difference]: With dead ends: 582 [2024-10-11 13:46:32,030 INFO L226 Difference]: Without dead ends: 288 [2024-10-11 13:46:32,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:46:32,032 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 103 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:46:32,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 447 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-11 13:46:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-11 13:46:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 282. [2024-10-11 13:46:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 213 states have (on average 1.3098591549295775) internal successors, (279), 215 states have internal predecessors, (279), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-11 13:46:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 403 transitions. [2024-10-11 13:46:32,059 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 403 transitions. Word has length 154 [2024-10-11 13:46:32,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:46:32,059 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 403 transitions. [2024-10-11 13:46:32,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2024-10-11 13:46:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 403 transitions. [2024-10-11 13:46:32,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 13:46:32,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:46:32,062 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:32,079 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 (7)] Ended with exit code 0 [2024-10-11 13:46:32,262 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:46:32,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:46:32,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:46:32,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1320565995, now seen corresponding path program 1 times [2024-10-11 13:46:32,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:46:32,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771279879] [2024-10-11 13:46:32,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:46:32,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:46:32,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:46:32,265 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:46:32,266 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:46:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:46:32,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 13:46:32,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:46:32,781 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:46:33,078 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 52 treesize of output 24 [2024-10-11 13:46:33,196 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 52 treesize of output 24 [2024-10-11 13:46:33,359 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 47 treesize of output 34 [2024-10-11 13:46:33,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:33,611 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 62 treesize of output 37 [2024-10-11 13:46:33,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:33,779 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 62 treesize of output 37 [2024-10-11 13:46:33,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:33,969 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 62 treesize of output 37 [2024-10-11 13:46:34,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:34,216 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 62 treesize of output 37 [2024-10-11 13:46:34,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:34,245 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 62 treesize of output 37 [2024-10-11 13:46:34,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:34,320 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 53 treesize of output 23 [2024-10-11 13:46:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 538 proven. 66 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-10-11 13:46:34,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:46:34,963 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 48 proven. 66 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-10-11 13:46:34,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:46:34,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771279879] [2024-10-11 13:46:34,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771279879] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:46:34,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:46:34,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2024-10-11 13:46:34,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691512214] [2024-10-11 13:46:34,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:46:34,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 13:46:34,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:46:34,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 13:46:34,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:46:34,965 INFO L87 Difference]: Start difference. First operand 282 states and 403 transitions. Second operand has 19 states, 15 states have (on average 6.266666666666667) internal successors, (94), 17 states have internal predecessors, (94), 8 states have call successors, (34), 5 states have call predecessors, (34), 6 states have return successors, (34), 5 states have call predecessors, (34), 8 states have call successors, (34) [2024-10-11 13:46:39,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:46:39,210 INFO L93 Difference]: Finished difference Result 600 states and 831 transitions. [2024-10-11 13:46:39,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 13:46:39,211 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 6.266666666666667) internal successors, (94), 17 states have internal predecessors, (94), 8 states have call successors, (34), 5 states have call predecessors, (34), 6 states have return successors, (34), 5 states have call predecessors, (34), 8 states have call successors, (34) Word has length 154 [2024-10-11 13:46:39,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:46:39,216 INFO L225 Difference]: With dead ends: 600 [2024-10-11 13:46:39,216 INFO L226 Difference]: Without dead ends: 319 [2024-10-11 13:46:39,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 285 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2024-10-11 13:46:39,217 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 312 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:46:39,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 381 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 13:46:39,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-11 13:46:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 214. [2024-10-11 13:46:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 162 states have (on average 1.2592592592592593) internal successors, (204), 164 states have internal predecessors, (204), 42 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 13:46:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 288 transitions. [2024-10-11 13:46:39,246 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 288 transitions. Word has length 154 [2024-10-11 13:46:39,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:46:39,247 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 288 transitions. [2024-10-11 13:46:39,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 6.266666666666667) internal successors, (94), 17 states have internal predecessors, (94), 8 states have call successors, (34), 5 states have call predecessors, (34), 6 states have return successors, (34), 5 states have call predecessors, (34), 8 states have call successors, (34) [2024-10-11 13:46:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 288 transitions. [2024-10-11 13:46:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 13:46:39,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:46:39,249 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:39,269 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 (8)] Ended with exit code 0 [2024-10-11 13:46:39,450 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:46:39,450 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:46:39,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:46:39,451 INFO L85 PathProgramCache]: Analyzing trace with hash 108777546, now seen corresponding path program 1 times [2024-10-11 13:46:39,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:46:39,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142543784] [2024-10-11 13:46:39,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:46:39,451 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:46:39,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:46:39,452 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:46:39,453 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:46:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:46:39,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 13:46:39,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:46:40,093 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:46:40,292 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 80 treesize of output 34 [2024-10-11 13:46:40,434 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 75 treesize of output 44 [2024-10-11 13:46:40,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:40,695 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 90 treesize of output 47 [2024-10-11 13:46:40,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:40,901 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 85 treesize of output 57 [2024-10-11 13:46:41,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:41,264 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 95 treesize of output 70 [2024-10-11 13:46:41,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:41,791 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 161 treesize of output 106 [2024-10-11 13:46:41,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:41,912 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 161 treesize of output 97 [2024-10-11 13:46:42,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:42,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 251 treesize of output 89 [2024-10-11 13:46:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 176 proven. 440 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-10-11 13:46:42,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:46:42,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:46:42,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142543784] [2024-10-11 13:46:42,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142543784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:46:42,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1793080372] [2024-10-11 13:46:42,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:46:42,606 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:46:42,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:46:42,607 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:46:42,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-10-11 13:46:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:46:44,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-11 13:46:44,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:46:44,555 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 25 treesize of output 13 [2024-10-11 13:46:45,297 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:46:46,149 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 64 treesize of output 32 [2024-10-11 13:46:48,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:48,799 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 1 case distinctions, treesize of input 107 treesize of output 69 [2024-10-11 13:46:49,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:49,559 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 3 case distinctions, treesize of input 118 treesize of output 72 [2024-10-11 13:46:50,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:50,053 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 3 case distinctions, treesize of input 115 treesize of output 80 [2024-10-11 13:46:50,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:50,932 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 6 case distinctions, treesize of input 123 treesize of output 91 [2024-10-11 13:46:51,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:51,988 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 10 case distinctions, treesize of input 173 treesize of output 121 [2024-10-11 13:46:52,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:46:52,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 173 treesize of output 116