./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 221b5a6bbea2d3affa28d277422c6c16e25871b0f2e6dd0968bfbdc5b5eb82af --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:17:59,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:17:59,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:17:59,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:17:59,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:17:59,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:17:59,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:17:59,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:17:59,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:17:59,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:17:59,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:17:59,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:17:59,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:17:59,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:17:59,866 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:17:59,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:17:59,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:17:59,867 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:17:59,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:17:59,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:17:59,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:17:59,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:17:59,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:17:59,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:17:59,869 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:17:59,869 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:17:59,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:17:59,870 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:17:59,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:17:59,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:17:59,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:17:59,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:17:59,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:17:59,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:17:59,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:17:59,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:17:59,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:17:59,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:17:59,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:17:59,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:17:59,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:17:59,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:17:59,873 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 221b5a6bbea2d3affa28d277422c6c16e25871b0f2e6dd0968bfbdc5b5eb82af [2024-11-19 01:18:00,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:18:00,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:18:00,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:18:00,111 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:18:00,112 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:18:00,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2024-11-19 01:18:00,607 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:18:02,183 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:18:02,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2024-11-19 01:18:02,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8adb1d25/89c773cfec494dba9d279ed2c19a8654/FLAG1f22808a8 [2024-11-19 01:18:02,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8adb1d25/89c773cfec494dba9d279ed2c19a8654 [2024-11-19 01:18:02,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:18:02,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:18:02,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:18:02,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:18:02,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:18:02,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:18:02" (1/1) ... [2024-11-19 01:18:02,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@156fcda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:02, skipping insertion in model container [2024-11-19 01:18:02,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:18:02" (1/1) ... [2024-11-19 01:18:02,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:18:02,415 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i[917,930] [2024-11-19 01:18:02,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:18:02,492 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:18:02,501 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i[917,930] [2024-11-19 01:18:02,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:18:02,537 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:18:02,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:02 WrapperNode [2024-11-19 01:18:02,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:18:02,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:18:02,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:18:02,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:18:02,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:02" (1/1) ... [2024-11-19 01:18:02,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:02" (1/1) ... [2024-11-19 01:18:02,588 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 460 [2024-11-19 01:18:02,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:18:02,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:18:02,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:18:02,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:18:02,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:02" (1/1) ... [2024-11-19 01:18:02,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:02" (1/1) ... [2024-11-19 01:18:02,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:02" (1/1) ... [2024-11-19 01:18:02,618 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-11-19 01:18:02,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:02" (1/1) ... [2024-11-19 01:18:02,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:02" (1/1) ... [2024-11-19 01:18:02,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:02" (1/1) ... [2024-11-19 01:18:02,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:02" (1/1) ... [2024-11-19 01:18:02,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:02" (1/1) ... [2024-11-19 01:18:02,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:02" (1/1) ... [2024-11-19 01:18:02,640 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:18:02,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:18:02,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:18:02,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:18:02,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:02" (1/1) ... [2024-11-19 01:18:02,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:18:02,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:18:02,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:18:02,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:18:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:18:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 01:18:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 01:18:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 01:18:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 01:18:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 01:18:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 01:18:02,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 01:18:02,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 01:18:02,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 01:18:02,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 01:18:02,714 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:18:02,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:18:02,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:18:02,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 01:18:02,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:18:02,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:18:02,824 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:18:02,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:18:03,186 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2024-11-19 01:18:03,187 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:18:03,203 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:18:03,203 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:18:03,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:18:03 BoogieIcfgContainer [2024-11-19 01:18:03,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:18:03,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:18:03,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:18:03,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:18:03,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:18:02" (1/3) ... [2024-11-19 01:18:03,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237017a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:18:03, skipping insertion in model container [2024-11-19 01:18:03,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:02" (2/3) ... [2024-11-19 01:18:03,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237017a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:18:03, skipping insertion in model container [2024-11-19 01:18:03,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:18:03" (3/3) ... [2024-11-19 01:18:03,210 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-47.i [2024-11-19 01:18:03,223 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:18:03,223 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:18:03,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:18:03,273 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;@57deca4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:18:03,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:18:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:18:03,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:18:03,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:03,289 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:18:03,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:03,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:03,295 INFO L85 PathProgramCache]: Analyzing trace with hash -766083450, now seen corresponding path program 1 times [2024-11-19 01:18:03,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:18:03,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548757097] [2024-11-19 01:18:03,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:18:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-19 01:18:03,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:18:03,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548757097] [2024-11-19 01:18:03,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548757097] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:18:03,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521432492] [2024-11-19 01:18:03,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:03,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:18:03,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:18:03,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:18:03,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 01:18:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:03,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:18:03,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-19 01:18:03,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:18:03,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521432492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:03,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:18:03,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:18:03,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643005125] [2024-11-19 01:18:03,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:03,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:18:03,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:18:03,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:18:03,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:18:03,840 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 01:18:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:03,862 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-19 01:18:03,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:18:03,864 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-11-19 01:18:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:03,870 INFO L225 Difference]: With dead ends: 185 [2024-11-19 01:18:03,870 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 01:18:03,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:18:03,877 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:03,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:18:03,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 01:18:03,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-19 01:18:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:18:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-19 01:18:03,913 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2024-11-19 01:18:03,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:03,913 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-19 01:18:03,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 01:18:03,914 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-19 01:18:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:18:03,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:03,916 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:18:03,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 01:18:04,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 01:18:04,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:04,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:04,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1428001612, now seen corresponding path program 1 times [2024-11-19 01:18:04,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:18:04,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696524846] [2024-11-19 01:18:04,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:04,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:18:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:18:04,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:18:04,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696524846] [2024-11-19 01:18:04,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696524846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:04,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:18:04,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:18:04,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038212480] [2024-11-19 01:18:04,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:04,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:18:04,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:18:04,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:18:04,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:18:04,265 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:04,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:04,292 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-11-19 01:18:04,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:18:04,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 01:18:04,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:04,295 INFO L225 Difference]: With dead ends: 182 [2024-11-19 01:18:04,295 INFO L226 Difference]: Without dead ends: 93 [2024-11-19 01:18:04,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:18:04,297 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:04,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:18:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-19 01:18:04,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-19 01:18:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:18:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-19 01:18:04,306 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2024-11-19 01:18:04,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:04,307 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-19 01:18:04,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-19 01:18:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:18:04,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:04,309 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:18:04,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:18:04,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:04,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:04,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1178021942, now seen corresponding path program 1 times [2024-11-19 01:18:04,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:18:04,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770712912] [2024-11-19 01:18:04,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:04,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:18:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:04,586 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 01:18:04,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:18:04,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770712912] [2024-11-19 01:18:04,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770712912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:18:04,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268719191] [2024-11-19 01:18:04,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:04,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:18:04,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:18:04,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:18:04,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 01:18:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:04,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:18:04,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:18:04,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:18:04,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268719191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:04,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:18:04,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-19 01:18:04,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181995304] [2024-11-19 01:18:04,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:04,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:18:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:18:04,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:18:04,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:18:04,778 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:04,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:04,817 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-19 01:18:04,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:18:04,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 01:18:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:04,819 INFO L225 Difference]: With dead ends: 186 [2024-11-19 01:18:04,819 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 01:18:04,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:18:04,821 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:04,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 384 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:18:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 01:18:04,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-19 01:18:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:18:04,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-19 01:18:04,832 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 84 [2024-11-19 01:18:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:04,832 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-19 01:18:04,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-19 01:18:04,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:18:04,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:04,834 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:18:04,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 01:18:05,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-19 01:18:05,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:05,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:05,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1179868984, now seen corresponding path program 1 times [2024-11-19 01:18:05,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:18:05,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37042186] [2024-11-19 01:18:05,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:05,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:18:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 01:18:05,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:18:05,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37042186] [2024-11-19 01:18:05,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37042186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:18:05,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343035282] [2024-11-19 01:18:05,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:05,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:18:05,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:18:05,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:18:05,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 01:18:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:05,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:18:05,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:18:05,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:18:05,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343035282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:05,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:18:05,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-19 01:18:05,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498990621] [2024-11-19 01:18:05,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:05,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:18:05,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:18:05,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:18:05,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:18:05,399 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:05,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:05,435 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2024-11-19 01:18:05,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:18:05,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 01:18:05,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:05,437 INFO L225 Difference]: With dead ends: 190 [2024-11-19 01:18:05,437 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 01:18:05,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:18:05,438 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:05,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:18:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 01:18:05,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-19 01:18:05,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 87 states have internal predecessors, (122), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:18:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-19 01:18:05,448 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 84 [2024-11-19 01:18:05,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:05,449 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-19 01:18:05,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:05,450 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-19 01:18:05,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:18:05,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:05,451 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:18:05,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 01:18:05,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:18:05,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:05,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:05,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1603693142, now seen corresponding path program 1 times [2024-11-19 01:18:05,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:18:05,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514702902] [2024-11-19 01:18:05,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:05,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:18:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:18:05,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:18:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:18:05,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:18:05,820 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:18:05,820 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:18:05,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:18:05,824 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-19 01:18:05,909 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:18:05,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:18:05 BoogieIcfgContainer [2024-11-19 01:18:05,912 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:18:05,912 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:18:05,912 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:18:05,912 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:18:05,913 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:18:03" (3/4) ... [2024-11-19 01:18:05,914 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:18:05,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:18:05,916 INFO L158 Benchmark]: Toolchain (without parser) took 3703.02ms. Allocated memory was 157.3MB in the beginning and 197.1MB in the end (delta: 39.8MB). Free memory was 90.6MB in the beginning and 121.6MB in the end (delta: -30.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-11-19 01:18:05,916 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:18:05,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.39ms. Allocated memory is still 157.3MB. Free memory was 90.2MB in the beginning and 125.3MB in the end (delta: -35.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:18:05,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.09ms. Allocated memory is still 157.3MB. Free memory was 124.8MB in the beginning and 121.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:18:05,916 INFO L158 Benchmark]: Boogie Preprocessor took 51.02ms. Allocated memory is still 157.3MB. Free memory was 121.9MB in the beginning and 117.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:18:05,916 INFO L158 Benchmark]: RCFGBuilder took 563.26ms. Allocated memory is still 157.3MB. Free memory was 117.7MB in the beginning and 87.4MB in the end (delta: 30.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-19 01:18:05,917 INFO L158 Benchmark]: TraceAbstraction took 2705.96ms. Allocated memory was 157.3MB in the beginning and 197.1MB in the end (delta: 39.8MB). Free memory was 87.0MB in the beginning and 122.6MB in the end (delta: -35.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-11-19 01:18:05,918 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 197.1MB. Free memory was 122.6MB in the beginning and 121.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:18:05,919 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.14ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.39ms. Allocated memory is still 157.3MB. Free memory was 90.2MB in the beginning and 125.3MB in the end (delta: -35.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.09ms. Allocated memory is still 157.3MB. Free memory was 124.8MB in the beginning and 121.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.02ms. Allocated memory is still 157.3MB. Free memory was 121.9MB in the beginning and 117.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 563.26ms. Allocated memory is still 157.3MB. Free memory was 117.7MB in the beginning and 87.4MB in the end (delta: 30.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2705.96ms. Allocated memory was 157.3MB in the beginning and 197.1MB in the end (delta: 39.8MB). Free memory was 87.0MB in the beginning and 122.6MB in the end (delta: -35.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 197.1MB. Free memory was 122.6MB in the beginning and 121.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L45] double* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] double* WrapperStruct0_var_1_8_Pointer = &(WrapperStruct0.var_1_8); [L47] signed char* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L48] signed char* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L49] signed char* WrapperStruct0_var_1_11_Pointer = &(WrapperStruct0.var_1_11); [L50] signed long int* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L51] unsigned char* WrapperStruct0_var_1_13_Pointer = &(WrapperStruct0.var_1_13); [L52] unsigned char* WrapperStruct0_var_1_14_Pointer = &(WrapperStruct0.var_1_14); [L53] double* WrapperStruct0_var_1_15_Pointer = &(WrapperStruct0.var_1_15); [L54] signed long int last_1_WrapperStruct0_var_1_12 = 8; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=0, last_1_WrapperStruct0_var_1_12=8] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] EXPR WrapperStruct0.var_1_12 [L101] last_1_WrapperStruct0_var_1_12 = WrapperStruct0.var_1_12 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L85] WrapperStruct0.var_1_8 = __VERIFIER_nondet_double() [L86] EXPR WrapperStruct0.var_1_8 [L86] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F [L86] EXPR WrapperStruct0.var_1_8 [L86] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] CALL assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] RET assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L87] WrapperStruct0.var_1_10 = __VERIFIER_nondet_char() [L88] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L88] CALL assume_abort_if_not(WrapperStruct0.var_1_10 >= -63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L88] RET assume_abort_if_not(WrapperStruct0.var_1_10 >= -63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] CALL assume_abort_if_not(WrapperStruct0.var_1_10 <= 63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] RET assume_abort_if_not(WrapperStruct0.var_1_10 <= 63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L90] WrapperStruct0.var_1_11 = __VERIFIER_nondet_char() [L91] EXPR WrapperStruct0.var_1_11 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L91] CALL assume_abort_if_not(WrapperStruct0.var_1_11 >= -63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L91] RET assume_abort_if_not(WrapperStruct0.var_1_11 >= -63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L92] EXPR WrapperStruct0.var_1_11 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L92] CALL assume_abort_if_not(WrapperStruct0.var_1_11 <= 63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L92] RET assume_abort_if_not(WrapperStruct0.var_1_11 <= 63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L93] WrapperStruct0.var_1_13 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct0.var_1_13 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L94] CALL assume_abort_if_not(WrapperStruct0.var_1_13 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L94] RET assume_abort_if_not(WrapperStruct0.var_1_13 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR WrapperStruct0.var_1_13 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] CALL assume_abort_if_not(WrapperStruct0.var_1_13 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] RET assume_abort_if_not(WrapperStruct0.var_1_13 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L96] WrapperStruct0.var_1_14 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L97] CALL assume_abort_if_not(WrapperStruct0.var_1_14 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L97] RET assume_abort_if_not(WrapperStruct0.var_1_14 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L98] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L98] CALL assume_abort_if_not(WrapperStruct0.var_1_14 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L98] RET assume_abort_if_not(WrapperStruct0.var_1_14 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L112] RET updateVariables() [L113] CALL step() [L58] COND FALSE !(-4 > last_1_WrapperStruct0_var_1_12) [L63] EXPR \read(*WrapperStruct0_var_1_10_Pointer) [L63] (*(WrapperStruct0_var_1_9_Pointer)) = (*(WrapperStruct0_var_1_10_Pointer)) [L65] EXPR \read(*WrapperStruct0_var_1_13_Pointer) [L65] unsigned char stepLocal_0 = ! (*(WrapperStruct0_var_1_13_Pointer)); [L66] stepLocal_0 || (*(WrapperStruct0_var_1_14_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L66] stepLocal_0 || (*(WrapperStruct0_var_1_14_Pointer)) [L66] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L66] stepLocal_0 || (*(WrapperStruct0_var_1_14_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L66] COND FALSE !(stepLocal_0 || (*(WrapperStruct0_var_1_14_Pointer))) [L73] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L73] (*(WrapperStruct0_var_1_15_Pointer)) = (*(WrapperStruct0_var_1_8_Pointer)) [L74] EXPR \read(*WrapperStruct0_var_1_15_Pointer) [L74] EXPR \read(*WrapperStruct0_var_1_15_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L74] COND FALSE !((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) [L79] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L79] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L79] COND TRUE (*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer)) [L80] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L80] (*(WrapperStruct0_var_1_1_Pointer)) = (*(WrapperStruct0_var_1_8_Pointer)) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*WrapperStruct0_var_1_15_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_15_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1) [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1 [L104] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR (((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR (((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR (((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_15_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR (((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_15_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104-L105] return (((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_15_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 758 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 529 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 581 ConstructedInterpolants, 0 QuantifiedInterpolants, 615 SizeOfPredicates, 0 NumberOfNonLiveVariables, 971 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 974/1008 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 01:18:05,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 221b5a6bbea2d3affa28d277422c6c16e25871b0f2e6dd0968bfbdc5b5eb82af --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:18:07,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:18:07,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:18:07,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:18:07,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:18:07,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:18:07,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:18:07,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:18:07,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:18:07,858 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:18:07,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:18:07,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:18:07,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:18:07,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:18:07,859 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:18:07,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:18:07,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:18:07,863 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:18:07,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:18:07,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:18:07,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:18:07,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:18:07,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:18:07,865 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:18:07,865 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:18:07,865 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:18:07,865 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:18:07,865 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:18:07,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:18:07,866 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:18:07,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:18:07,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:18:07,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:18:07,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:18:07,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:18:07,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:18:07,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:18:07,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:18:07,875 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:18:07,875 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:18:07,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:18:07,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:18:07,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:18:07,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:18:07,876 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 221b5a6bbea2d3affa28d277422c6c16e25871b0f2e6dd0968bfbdc5b5eb82af [2024-11-19 01:18:08,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:18:08,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:18:08,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:18:08,148 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:18:08,149 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:18:08,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2024-11-19 01:18:09,420 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:18:09,575 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:18:09,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2024-11-19 01:18:09,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca08f760/46b8e38247ba46cc816a4350928edb79/FLAG5be017e76 [2024-11-19 01:18:09,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca08f760/46b8e38247ba46cc816a4350928edb79 [2024-11-19 01:18:09,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:18:09,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:18:09,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:18:09,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:18:09,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:18:09,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:18:09" (1/1) ... [2024-11-19 01:18:09,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e0ebed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:09, skipping insertion in model container [2024-11-19 01:18:09,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:18:09" (1/1) ... [2024-11-19 01:18:09,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:18:09,770 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i[917,930] [2024-11-19 01:18:09,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:18:09,846 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:18:09,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i[917,930] [2024-11-19 01:18:09,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:18:09,905 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:18:09,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:09 WrapperNode [2024-11-19 01:18:09,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:18:09,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:18:09,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:18:09,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:18:09,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:09" (1/1) ... [2024-11-19 01:18:09,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:09" (1/1) ... [2024-11-19 01:18:09,969 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 458 [2024-11-19 01:18:09,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:18:09,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:18:09,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:18:09,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:18:09,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:09" (1/1) ... [2024-11-19 01:18:09,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:09" (1/1) ... [2024-11-19 01:18:09,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:09" (1/1) ... [2024-11-19 01:18:10,010 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-11-19 01:18:10,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:09" (1/1) ... [2024-11-19 01:18:10,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:09" (1/1) ... [2024-11-19 01:18:10,020 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:09" (1/1) ... [2024-11-19 01:18:10,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:09" (1/1) ... [2024-11-19 01:18:10,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:09" (1/1) ... [2024-11-19 01:18:10,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:09" (1/1) ... [2024-11-19 01:18:10,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:18:10,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:18:10,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:18:10,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:18:10,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:09" (1/1) ... [2024-11-19 01:18:10,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:18:10,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:18:10,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:18:10,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:18:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:18:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 01:18:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 01:18:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 01:18:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 01:18:10,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:18:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:18:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:18:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:18:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 01:18:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 01:18:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 01:18:10,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 01:18:10,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 01:18:10,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 01:18:10,116 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:18:10,117 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:18:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:18:10,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:18:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:18:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:18:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 01:18:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 01:18:10,220 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:18:10,222 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:18:10,688 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-11-19 01:18:10,688 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:18:10,703 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:18:10,703 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:18:10,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:18:10 BoogieIcfgContainer [2024-11-19 01:18:10,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:18:10,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:18:10,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:18:10,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:18:10,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:18:09" (1/3) ... [2024-11-19 01:18:10,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66db42a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:18:10, skipping insertion in model container [2024-11-19 01:18:10,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:09" (2/3) ... [2024-11-19 01:18:10,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66db42a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:18:10, skipping insertion in model container [2024-11-19 01:18:10,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:18:10" (3/3) ... [2024-11-19 01:18:10,710 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-47.i [2024-11-19 01:18:10,722 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:18:10,723 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:18:10,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:18:10,814 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;@1c39e65f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:18:10,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:18:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:18:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:18:10,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:10,843 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:18:10,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:10,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash -766083450, now seen corresponding path program 1 times [2024-11-19 01:18:10,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:18:10,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114543434] [2024-11-19 01:18:10,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:10,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:10,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:18:10,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:18:10,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 01:18:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:11,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:18:11,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:11,152 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 01:18:11,152 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:18:11,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:18:11,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114543434] [2024-11-19 01:18:11,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114543434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:11,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:18:11,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:18:11,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899753159] [2024-11-19 01:18:11,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:11,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:18:11,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:18:11,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:18:11,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:18:11,180 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 01:18:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:11,205 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-19 01:18:11,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:18:11,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-11-19 01:18:11,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:11,213 INFO L225 Difference]: With dead ends: 185 [2024-11-19 01:18:11,213 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 01:18:11,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:18:11,218 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:11,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:18:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 01:18:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-19 01:18:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:18:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-19 01:18:11,250 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2024-11-19 01:18:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:11,250 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-19 01:18:11,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 01:18:11,250 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-19 01:18:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:18:11,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:11,254 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:18:11,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 01:18:11,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:11,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:11,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:11,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1428001612, now seen corresponding path program 1 times [2024-11-19 01:18:11,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:18:11,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958566208] [2024-11-19 01:18:11,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:11,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:11,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:18:11,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:18:11,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 01:18:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:11,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 01:18:11,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:11,701 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:18:11,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:18:11,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:18:11,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958566208] [2024-11-19 01:18:11,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958566208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:11,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:18:11,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:18:11,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039261074] [2024-11-19 01:18:11,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:11,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:18:11,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:18:11,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:18:11,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:18:11,715 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:11,858 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-11-19 01:18:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:18:11,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 01:18:11,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:11,861 INFO L225 Difference]: With dead ends: 182 [2024-11-19 01:18:11,861 INFO L226 Difference]: Without dead ends: 93 [2024-11-19 01:18:11,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:18:11,863 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:11,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:18:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-19 01:18:11,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-19 01:18:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:18:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-19 01:18:11,871 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2024-11-19 01:18:11,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:11,872 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-19 01:18:11,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:11,872 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-19 01:18:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:18:11,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:11,874 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:18:11,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 01:18:12,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:12,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:12,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:12,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1178021942, now seen corresponding path program 1 times [2024-11-19 01:18:12,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:18:12,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284722407] [2024-11-19 01:18:12,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:12,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:12,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:18:12,080 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:18:12,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 01:18:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:12,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:18:12,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:18:12,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:18:12,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:18:12,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284722407] [2024-11-19 01:18:12,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284722407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:12,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:18:12,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:18:12,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328215695] [2024-11-19 01:18:12,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:12,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:18:12,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:18:12,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:18:12,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:18:12,325 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:12,841 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-19 01:18:12,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:18:12,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 01:18:12,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:12,846 INFO L225 Difference]: With dead ends: 186 [2024-11-19 01:18:12,847 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 01:18:12,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:18:12,848 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 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.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:12,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:18:12,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 01:18:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-19 01:18:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:18:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-19 01:18:12,854 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 84 [2024-11-19 01:18:12,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:12,855 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-19 01:18:12,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:12,855 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-19 01:18:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:18:12,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:12,856 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:18:12,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 01:18:13,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:13,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:13,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:13,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1605540184, now seen corresponding path program 1 times [2024-11-19 01:18:13,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:18:13,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475692846] [2024-11-19 01:18:13,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:13,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:13,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:18:13,066 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:18:13,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 01:18:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:13,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:18:13,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:18:13,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:18:13,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:18:13,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475692846] [2024-11-19 01:18:13,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475692846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:13,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:18:13,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:18:13,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451064262] [2024-11-19 01:18:13,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:13,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:18:13,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:18:13,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:18:13,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:18:13,321 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:14,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:18:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:14,891 INFO L93 Difference]: Finished difference Result 194 states and 280 transitions. [2024-11-19 01:18:14,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:18:14,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 01:18:14,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:14,892 INFO L225 Difference]: With dead ends: 194 [2024-11-19 01:18:14,892 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 01:18:14,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:18:14,893 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:14,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 01:18:14,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 01:18:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-19 01:18:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 01:18:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-19 01:18:14,899 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 84 [2024-11-19 01:18:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:14,900 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-19 01:18:14,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-19 01:18:14,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:18:14,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:14,901 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:18:14,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 01:18:15,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:15,106 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:15,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:15,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1603693142, now seen corresponding path program 1 times [2024-11-19 01:18:15,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:18:15,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627139976] [2024-11-19 01:18:15,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:15,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:15,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:18:15,111 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:18:15,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 01:18:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:15,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 01:18:15,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:15,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-19 01:18:16,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 55 [2024-11-19 01:18:16,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 63 [2024-11-19 01:18:16,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 74 [2024-11-19 01:18:17,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 85 [2024-11-19 01:18:18,199 INFO L349 Elim1Store]: treesize reduction 79, result has 16.0 percent of original size [2024-11-19 01:18:18,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 112 [2024-11-19 01:18:18,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:18:18,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 167 treesize of output 79 [2024-11-19 01:18:18,468 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 64 proven. 56 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 01:18:18,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:18:18,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:18:18,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627139976] [2024-11-19 01:18:18,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627139976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:18:18,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [957270451] [2024-11-19 01:18:18,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:18,790 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 01:18:18,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 01:18:18,792 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 01:18:18,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-19 01:18:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:19,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 01:18:19,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:20,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-19 01:18:21,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 71 [2024-11-19 01:18:21,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 82 [2024-11-19 01:18:22,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 99 [2024-11-19 01:18:22,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 110 [2024-11-19 01:18:23,633 INFO L349 Elim1Store]: treesize reduction 91, result has 14.2 percent of original size [2024-11-19 01:18:23,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 136 treesize of output 137 [2024-11-19 01:18:23,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 51 [2024-11-19 01:18:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 01:18:28,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:18:28,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [957270451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:18:28,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:18:28,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2024-11-19 01:18:28,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949878477] [2024-11-19 01:18:28,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:18:28,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 01:18:28,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:18:28,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 01:18:28,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=544, Unknown=1, NotChecked=0, Total=650 [2024-11-19 01:18:28,287 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-19 01:18:33,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:33,757 INFO L93 Difference]: Finished difference Result 370 states and 516 transitions. [2024-11-19 01:18:33,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 01:18:33,757 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) Word has length 84 [2024-11-19 01:18:33,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:33,759 INFO L225 Difference]: With dead ends: 370 [2024-11-19 01:18:33,759 INFO L226 Difference]: Without dead ends: 273 [2024-11-19 01:18:33,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=271, Invalid=1060, Unknown=1, NotChecked=0, Total=1332 [2024-11-19 01:18:33,760 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1361 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:33,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 822 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-19 01:18:33,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-19 01:18:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 150. [2024-11-19 01:18:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 125 states have (on average 1.328) internal successors, (166), 125 states have internal predecessors, (166), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 01:18:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 202 transitions. [2024-11-19 01:18:33,786 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 202 transitions. Word has length 84 [2024-11-19 01:18:33,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:33,786 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 202 transitions. [2024-11-19 01:18:33,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-19 01:18:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 202 transitions. [2024-11-19 01:18:33,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:18:33,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:33,788 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:18:33,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-19 01:18:33,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 01:18:34,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:34,189 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:34,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:34,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1303975955, now seen corresponding path program 1 times [2024-11-19 01:18:34,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:18:34,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43435540] [2024-11-19 01:18:34,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:34,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:34,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:18:34,194 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:18:34,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 01:18:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:34,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:18:34,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:34,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:18:34,422 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 136 treesize of output 46 [2024-11-19 01:18:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:18:34,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:18:34,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:18:34,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43435540] [2024-11-19 01:18:34,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43435540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:34,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:18:34,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:18:34,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698543241] [2024-11-19 01:18:34,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:34,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:18:34,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:18:34,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:18:34,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:18:34,506 INFO L87 Difference]: Start difference. First operand 150 states and 202 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:37,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:37,397 INFO L93 Difference]: Finished difference Result 342 states and 462 transitions. [2024-11-19 01:18:37,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:18:37,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 01:18:37,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:37,399 INFO L225 Difference]: With dead ends: 342 [2024-11-19 01:18:37,399 INFO L226 Difference]: Without dead ends: 195 [2024-11-19 01:18:37,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:18:37,400 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 57 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:37,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 366 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-19 01:18:37,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-19 01:18:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 152. [2024-11-19 01:18:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.3228346456692914) internal successors, (168), 127 states have internal predecessors, (168), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 01:18:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 204 transitions. [2024-11-19 01:18:37,420 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 204 transitions. Word has length 84 [2024-11-19 01:18:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:37,420 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 204 transitions. [2024-11-19 01:18:37,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 204 transitions. [2024-11-19 01:18:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 01:18:37,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:37,426 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:18:37,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 01:18:37,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:37,627 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:37,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:37,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1363453396, now seen corresponding path program 1 times [2024-11-19 01:18:37,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:18:37,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779439604] [2024-11-19 01:18:37,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:37,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:37,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:18:37,629 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:18:37,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 01:18:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:37,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:18:37,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:18:37,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:18:37,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:18:37,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779439604] [2024-11-19 01:18:37,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779439604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:37,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:18:37,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:18:37,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415471702] [2024-11-19 01:18:37,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:37,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:18:37,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:18:37,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:18:37,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:18:37,789 INFO L87 Difference]: Start difference. First operand 152 states and 204 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:37,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:37,829 INFO L93 Difference]: Finished difference Result 301 states and 405 transitions. [2024-11-19 01:18:37,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:18:37,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 01:18:37,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:37,831 INFO L225 Difference]: With dead ends: 301 [2024-11-19 01:18:37,831 INFO L226 Difference]: Without dead ends: 152 [2024-11-19 01:18:37,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:18:37,832 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:37,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:18:37,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-19 01:18:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-19 01:18:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.31496062992126) internal successors, (167), 127 states have internal predecessors, (167), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 01:18:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 203 transitions. [2024-11-19 01:18:37,847 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 203 transitions. Word has length 84 [2024-11-19 01:18:37,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:37,847 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 203 transitions. [2024-11-19 01:18:37,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 203 transitions. [2024-11-19 01:18:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 01:18:37,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:37,849 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:18:37,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 01:18:38,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:38,049 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:38,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:38,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1802536291, now seen corresponding path program 1 times [2024-11-19 01:18:38,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:18:38,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525024925] [2024-11-19 01:18:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:38,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:38,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:18:38,051 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:18:38,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 01:18:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:38,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 01:18:38,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:38,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 01:18:38,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 55 [2024-11-19 01:18:39,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 55 [2024-11-19 01:18:39,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 55 [2024-11-19 01:18:40,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 63 [2024-11-19 01:18:40,613 INFO L349 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2024-11-19 01:18:40,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 90 [2024-11-19 01:18:40,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 78 [2024-11-19 01:18:40,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:18:40,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 71 [2024-11-19 01:18:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-19 01:18:40,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:18:41,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:18:41,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525024925] [2024-11-19 01:18:41,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525024925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:18:41,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2043933534] [2024-11-19 01:18:41,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:41,444 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 01:18:41,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 01:18:41,445 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 01:18:41,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-19 01:18:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:42,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-19 01:18:42,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:42,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-19 01:18:43,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 63 [2024-11-19 01:18:44,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 66 [2024-11-19 01:18:45,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 66 [2024-11-19 01:18:46,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 66 [2024-11-19 01:18:46,782 INFO L349 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2024-11-19 01:18:46,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 90 [2024-11-19 01:18:47,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 78 [2024-11-19 01:18:47,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 115 [2024-11-19 01:18:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 01:18:47,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:18:48,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2043933534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:18:48,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:18:48,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2024-11-19 01:18:48,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118949450] [2024-11-19 01:18:48,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:18:48,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 01:18:48,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:18:48,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 01:18:48,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2024-11-19 01:18:48,637 INFO L87 Difference]: Start difference. First operand 152 states and 203 transitions. Second operand has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 states have internal predecessors, (80), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-19 01:18:52,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 01:18:54,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:54,437 INFO L93 Difference]: Finished difference Result 432 states and 586 transitions. [2024-11-19 01:18:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 01:18:54,439 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 states have internal predecessors, (80), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 85 [2024-11-19 01:18:54,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:54,440 INFO L225 Difference]: With dead ends: 432 [2024-11-19 01:18:54,440 INFO L226 Difference]: Without dead ends: 283 [2024-11-19 01:18:54,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 01:18:54,441 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 1020 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:54,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 701 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-19 01:18:54,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-19 01:18:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 161. [2024-11-19 01:18:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 136 states have (on average 1.3308823529411764) internal successors, (181), 136 states have internal predecessors, (181), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 01:18:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 217 transitions. [2024-11-19 01:18:54,457 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 217 transitions. Word has length 85 [2024-11-19 01:18:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:54,457 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 217 transitions. [2024-11-19 01:18:54,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 states have internal predecessors, (80), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-19 01:18:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 217 transitions. [2024-11-19 01:18:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 01:18:54,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:54,458 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:18:54,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-19 01:18:54,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 01:18:54,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:54,859 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:54,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:54,859 INFO L85 PathProgramCache]: Analyzing trace with hash -760820634, now seen corresponding path program 1 times [2024-11-19 01:18:54,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:18:54,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576166646] [2024-11-19 01:18:54,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:54,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:54,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:18:54,862 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:18:54,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 01:18:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:55,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 01:18:55,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:55,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:18:55,097 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 52 treesize of output 36 [2024-11-19 01:18:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 01:18:55,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:18:55,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:18:55,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576166646] [2024-11-19 01:18:55,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576166646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:55,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:18:55,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:18:55,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000049285] [2024-11-19 01:18:55,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:55,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:18:55,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:18:55,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:18:55,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:18:55,145 INFO L87 Difference]: Start difference. First operand 161 states and 217 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:55,572 INFO L93 Difference]: Finished difference Result 355 states and 480 transitions. [2024-11-19 01:18:55,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:18:55,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-11-19 01:18:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:55,574 INFO L225 Difference]: With dead ends: 355 [2024-11-19 01:18:55,574 INFO L226 Difference]: Without dead ends: 197 [2024-11-19 01:18:55,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:18:55,575 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 48 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:55,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 345 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:18:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-19 01:18:55,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 162. [2024-11-19 01:18:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 137 states have internal predecessors, (182), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 01:18:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 218 transitions. [2024-11-19 01:18:55,600 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 218 transitions. Word has length 86 [2024-11-19 01:18:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:55,600 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 218 transitions. [2024-11-19 01:18:55,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 01:18:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 218 transitions. [2024-11-19 01:18:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 01:18:55,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:55,601 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:18:55,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 01:18:55,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:55,802 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:55,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:55,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1522767668, now seen corresponding path program 1 times [2024-11-19 01:18:55,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:18:55,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249559875] [2024-11-19 01:18:55,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18: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-11-19 01:18:55,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:18:55,804 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:18:55,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 01:18:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:56,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 01:18:56,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:56,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-19 01:18:56,831 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 42 treesize of output 22 [2024-11-19 01:18:57,173 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 42 treesize of output 22 [2024-11-19 01:18:57,491 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 42 treesize of output 22 [2024-11-19 01:18:57,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2024-11-19 01:18:57,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2024-11-19 01:18:58,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:18:58,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 35 [2024-11-19 01:18:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 36 proven. 80 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 01:18:58,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:18:58,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:18:58,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249559875] [2024-11-19 01:18:58,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249559875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:18:58,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [412027566] [2024-11-19 01:18:58,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:58,649 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 01:18:58,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 01:18:58,652 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 01:18:58,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-19 01:18:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:59,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 01:18:59,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:59,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-19 01:19:01,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-11-19 01:19:03,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2024-11-19 01:19:04,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2024-11-19 01:19:04,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 63 [2024-11-19 01:19:05,623 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 0 case distinctions, treesize of input 65 treesize of output 75 [2024-11-19 01:19:05,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 86 [2024-11-19 01:19:09,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 65 [2024-11-19 01:19:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 52 proven. 80 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 01:19:09,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:19:19,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [412027566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:19:19,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:19:19,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 38 [2024-11-19 01:19:19,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381284652] [2024-11-19 01:19:19,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:19:19,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-19 01:19:19,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:19:19,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-19 01:19:19,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1921, Unknown=4, NotChecked=0, Total=2256 [2024-11-19 01:19:19,607 INFO L87 Difference]: Start difference. First operand 162 states and 218 transitions. Second operand has 39 states, 35 states have (on average 3.0285714285714285) internal successors, (106), 33 states have internal predecessors, (106), 11 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 10 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-19 01:19:27,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 01:19:34,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 01:19:37,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]