/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-19.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:21:23,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:21:23,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 02:21:23,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:21:23,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:21:23,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:21:23,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:21:23,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:21:23,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:21:23,918 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:21:23,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:21:23,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:21:23,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:21:23,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:21:23,919 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:21:23,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:21:23,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:21:23,920 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:21:23,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:21:23,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:21:23,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:21:23,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:21:23,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:21:23,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:21:23,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:21:23,922 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:21:23,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:21:23,922 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:21:23,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:21:23,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:21:23,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:21:23,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:21:23,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:21:23,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:21:23,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:21:23,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:21:23,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:21:23,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:21:23,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:21:23,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:21:23,924 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:21:23,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:21:23,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:21:23,925 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: Use bitabs translation -> false [2023-12-21 02:21:24,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:21:24,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:21:24,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:21:24,122 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:21:24,123 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:21:24,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-19.i [2023-12-21 02:21:25,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:21:25,312 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:21:25,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-19.i [2023-12-21 02:21:25,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb374518/162188b66a8246ea9a1ef3df82f44b4b/FLAG276b15299 [2023-12-21 02:21:25,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb374518/162188b66a8246ea9a1ef3df82f44b4b [2023-12-21 02:21:25,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:21:25,331 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:21:25,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:21:25,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:21:25,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:21:25,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:21:25" (1/1) ... [2023-12-21 02:21:25,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b9be53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:21:25, skipping insertion in model container [2023-12-21 02:21:25,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:21:25" (1/1) ... [2023-12-21 02:21:25,369 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:21:25,481 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-19.i[916,929] [2023-12-21 02:21:25,521 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:21:25,534 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:21:25,542 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-19.i[916,929] [2023-12-21 02:21:25,564 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:21:25,576 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:21:25,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:21:25 WrapperNode [2023-12-21 02:21:25,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:21:25,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:21:25,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:21:25,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:21:25,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:21:25" (1/1) ... [2023-12-21 02:21:25,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:21:25" (1/1) ... [2023-12-21 02:21:25,624 INFO L138 Inliner]: procedures = 26, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 452 [2023-12-21 02:21:25,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:21:25,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:21:25,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:21:25,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:21:25,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:21:25" (1/1) ... [2023-12-21 02:21:25,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:21:25" (1/1) ... [2023-12-21 02:21:25,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:21:25" (1/1) ... [2023-12-21 02:21:25,649 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 15 writes are split as follows [0, 15]. [2023-12-21 02:21:25,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:21:25" (1/1) ... [2023-12-21 02:21:25,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:21:25" (1/1) ... [2023-12-21 02:21:25,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:21:25" (1/1) ... [2023-12-21 02:21:25,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:21:25" (1/1) ... [2023-12-21 02:21:25,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:21:25" (1/1) ... [2023-12-21 02:21:25,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:21:25" (1/1) ... [2023-12-21 02:21:25,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:21:25,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:21:25,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:21:25,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:21:25,681 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:21:25" (1/1) ... [2023-12-21 02:21:25,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:21:25,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:21:25,734 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) [2023-12-21 02:21:25,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:21:25,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:21:25,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:21:25,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:21:25,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:21:25,761 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:21:25,761 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:21:25,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:21:25,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:21:25,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:21:25,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:21:25,764 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 [2023-12-21 02:21:25,838 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:21:25,839 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:21:26,205 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:21:26,227 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:21:26,228 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:21:26,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:21:26 BoogieIcfgContainer [2023-12-21 02:21:26,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:21:26,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:21:26,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:21:26,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:21:26,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:21:25" (1/3) ... [2023-12-21 02:21:26,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9b5053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:21:26, skipping insertion in model container [2023-12-21 02:21:26,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:21:25" (2/3) ... [2023-12-21 02:21:26,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9b5053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:21:26, skipping insertion in model container [2023-12-21 02:21:26,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:21:26" (3/3) ... [2023-12-21 02:21:26,234 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-19.i [2023-12-21 02:21:26,251 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:21:26,252 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:21:26,284 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:21:26,289 INFO L357 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, mHoare=true, 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;@75202335, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:21:26,289 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:21:26,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 71 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:21:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-21 02:21:26,302 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:26,302 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:21:26,303 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:26,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:26,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1246502459, now seen corresponding path program 1 times [2023-12-21 02:21:26,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:26,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048838758] [2023-12-21 02:21:26,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:26,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:26,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:26,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048838758] [2023-12-21 02:21:26,497 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-21 02:21:26,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682831727] [2023-12-21 02:21:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:26,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:21:26,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:21:26,501 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) [2023-12-21 02:21:26,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 02:21:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:26,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 02:21:26,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:21:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2023-12-21 02:21:26,709 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 02:21:26,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682831727] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:26,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:26,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:21:26,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364429232] [2023-12-21 02:21:26,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:26,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:21:26,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:26,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:21:26,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:21:26,735 INFO L87 Difference]: Start difference. First operand has 90 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 71 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 02:21:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:26,763 INFO L93 Difference]: Finished difference Result 177 states and 283 transitions. [2023-12-21 02:21:26,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:21:26,766 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 124 [2023-12-21 02:21:26,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:26,771 INFO L225 Difference]: With dead ends: 177 [2023-12-21 02:21:26,771 INFO L226 Difference]: Without dead ends: 88 [2023-12-21 02:21:26,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:21:26,775 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:26,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:21:26,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-21 02:21:26,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-21 02:21:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:21:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2023-12-21 02:21:26,807 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 124 [2023-12-21 02:21:26,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:26,807 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2023-12-21 02:21:26,807 INFO L496 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 02:21:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2023-12-21 02:21:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-21 02:21:26,810 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:26,810 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:21:26,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 02:21:27,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-21 02:21:27,018 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:27,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:27,019 INFO L85 PathProgramCache]: Analyzing trace with hash 200451033, now seen corresponding path program 1 times [2023-12-21 02:21:27,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:27,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614074279] [2023-12-21 02:21:27,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:27,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:27,075 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:21:27,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [94693432] [2023-12-21 02:21:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:27,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:21:27,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:21:27,078 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) [2023-12-21 02:21:27,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 02:21:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:27,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 02:21:27,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:21:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:21:27,276 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 02:21:27,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:27,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614074279] [2023-12-21 02:21:27,276 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:21:27,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94693432] [2023-12-21 02:21:27,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94693432] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:27,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:27,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:21:27,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339237960] [2023-12-21 02:21:27,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:27,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:21:27,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:27,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:21:27,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:21:27,279 INFO L87 Difference]: Start difference. First operand 88 states and 127 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:21:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:27,337 INFO L93 Difference]: Finished difference Result 179 states and 258 transitions. [2023-12-21 02:21:27,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:21:27,339 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 124 [2023-12-21 02:21:27,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:27,341 INFO L225 Difference]: With dead ends: 179 [2023-12-21 02:21:27,341 INFO L226 Difference]: Without dead ends: 92 [2023-12-21 02:21:27,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:21:27,345 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 3 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:27,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 357 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:21:27,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-21 02:21:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2023-12-21 02:21:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:21:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2023-12-21 02:21:27,359 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 124 [2023-12-21 02:21:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:27,360 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2023-12-21 02:21:27,360 INFO L496 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:21:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2023-12-21 02:21:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-21 02:21:27,362 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:27,363 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:21:27,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 02:21:27,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-21 02:21:27,564 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:27,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:27,564 INFO L85 PathProgramCache]: Analyzing trace with hash 200510615, now seen corresponding path program 1 times [2023-12-21 02:21:27,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:27,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975875981] [2023-12-21 02:21:27,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:27,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:27,596 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:21:27,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1636129418] [2023-12-21 02:21:27,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:27,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:21:27,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:21:27,613 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) [2023-12-21 02:21:27,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 02:21:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:27,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 02:21:27,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:21:27,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 51 [2023-12-21 02:21:27,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-12-21 02:21:27,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 26 [2023-12-21 02:21:28,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:21:28,026 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 167 treesize of output 83 [2023-12-21 02:21:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:21:28,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:21:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:21:28,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:28,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975875981] [2023-12-21 02:21:28,202 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:21:28,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636129418] [2023-12-21 02:21:28,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636129418] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:21:28,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:21:28,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2023-12-21 02:21:28,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090999212] [2023-12-21 02:21:28,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:28,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:21:28,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:28,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:21:28,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:21:28,206 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:21:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:28,530 INFO L93 Difference]: Finished difference Result 273 states and 385 transitions. [2023-12-21 02:21:28,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 02:21:28,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 124 [2023-12-21 02:21:28,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:28,537 INFO L225 Difference]: With dead ends: 273 [2023-12-21 02:21:28,538 INFO L226 Difference]: Without dead ends: 184 [2023-12-21 02:21:28,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-12-21 02:21:28,540 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 197 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:28,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 628 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:21:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-12-21 02:21:28,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 143. [2023-12-21 02:21:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 118 states have internal predecessors, (155), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 02:21:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 201 transitions. [2023-12-21 02:21:28,554 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 201 transitions. Word has length 124 [2023-12-21 02:21:28,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:28,554 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 201 transitions. [2023-12-21 02:21:28,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:21:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 201 transitions. [2023-12-21 02:21:28,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-21 02:21:28,556 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:28,556 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:21:28,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 02:21:28,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:21:28,765 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:28,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:28,765 INFO L85 PathProgramCache]: Analyzing trace with hash -810606635, now seen corresponding path program 1 times [2023-12-21 02:21:28,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:28,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626893387] [2023-12-21 02:21:28,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:28,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:28,808 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:21:28,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [438421079] [2023-12-21 02:21:28,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:28,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:21:28,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:21:28,821 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:21:28,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 02:21:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:28,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 02:21:28,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:21:29,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-21 02:21:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:21:29,016 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 02:21:29,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:29,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626893387] [2023-12-21 02:21:29,016 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:21:29,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438421079] [2023-12-21 02:21:29,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438421079] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:29,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:29,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:21:29,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860766463] [2023-12-21 02:21:29,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:29,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:21:29,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:29,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:21:29,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:21:29,021 INFO L87 Difference]: Start difference. First operand 143 states and 201 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:21:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:29,254 INFO L93 Difference]: Finished difference Result 410 states and 571 transitions. [2023-12-21 02:21:29,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:21:29,255 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 124 [2023-12-21 02:21:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:29,257 INFO L225 Difference]: With dead ends: 410 [2023-12-21 02:21:29,258 INFO L226 Difference]: Without dead ends: 268 [2023-12-21 02:21:29,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:21:29,259 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 115 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:29,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 551 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:21:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-12-21 02:21:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 205. [2023-12-21 02:21:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 166 states have (on average 1.3072289156626506) internal successors, (217), 168 states have internal predecessors, (217), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-21 02:21:29,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 287 transitions. [2023-12-21 02:21:29,271 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 287 transitions. Word has length 124 [2023-12-21 02:21:29,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:29,272 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 287 transitions. [2023-12-21 02:21:29,272 INFO L496 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:21:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 287 transitions. [2023-12-21 02:21:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-21 02:21:29,273 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:29,274 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:21:29,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-21 02:21:29,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:21:29,480 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:29,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1524392073, now seen corresponding path program 1 times [2023-12-21 02:21:29,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:29,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447582810] [2023-12-21 02:21:29,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:29,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:29,505 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:21:29,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1842802159] [2023-12-21 02:21:29,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:29,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:21:29,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:21:29,506 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:21:29,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-21 02:21:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:21:30,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 02:21:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:21:30,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 02:21:30,298 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 02:21:30,299 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:21:30,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-21 02:21:30,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:21:30,506 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-21 02:21:30,508 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:21:30,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:21:30 BoogieIcfgContainer [2023-12-21 02:21:30,570 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:21:30,572 INFO L158 Benchmark]: Toolchain (without parser) took 5239.52ms. Allocated memory was 187.7MB in the beginning and 270.5MB in the end (delta: 82.8MB). Free memory was 140.5MB in the beginning and 165.8MB in the end (delta: -25.3MB). Peak memory consumption was 58.4MB. Max. memory is 8.0GB. [2023-12-21 02:21:30,572 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:21:30,572 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.55ms. Allocated memory is still 187.7MB. Free memory was 140.1MB in the beginning and 124.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 02:21:30,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.92ms. Allocated memory is still 187.7MB. Free memory was 124.4MB in the beginning and 120.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:21:30,573 INFO L158 Benchmark]: Boogie Preprocessor took 52.95ms. Allocated memory is still 187.7MB. Free memory was 120.6MB in the beginning and 116.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:21:30,573 INFO L158 Benchmark]: RCFGBuilder took 547.58ms. Allocated memory is still 187.7MB. Free memory was 116.4MB in the beginning and 146.4MB in the end (delta: -30.1MB). Peak memory consumption was 22.7MB. Max. memory is 8.0GB. [2023-12-21 02:21:30,573 INFO L158 Benchmark]: TraceAbstraction took 4340.25ms. Allocated memory was 187.7MB in the beginning and 270.5MB in the end (delta: 82.8MB). Free memory was 145.4MB in the beginning and 165.8MB in the end (delta: -20.4MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. [2023-12-21 02:21:30,575 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.11ms. Allocated memory is still 187.7MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 245.55ms. Allocated memory is still 187.7MB. Free memory was 140.1MB in the beginning and 124.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.92ms. Allocated memory is still 187.7MB. Free memory was 124.4MB in the beginning and 120.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.95ms. Allocated memory is still 187.7MB. Free memory was 120.6MB in the beginning and 116.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 547.58ms. Allocated memory is still 187.7MB. Free memory was 116.4MB in the beginning and 146.4MB in the end (delta: -30.1MB). Peak memory consumption was 22.7MB. Max. memory is 8.0GB. * TraceAbstraction took 4340.25ms. Allocated memory was 187.7MB in the beginning and 270.5MB in the end (delta: 82.8MB). Free memory was 145.4MB in the beginning and 165.8MB in the end (delta: -20.4MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. * 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 bitwise operation at line 113. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L51] signed long int last_1_WrapperStruct00_var_1_11 = 10; [L117] isInitial = 1 [L118] FCALL initially() [L119] COND TRUE 1 [L120] CALL updateLastVariables() [L110] EXPR WrapperStruct00.var_1_11 [L110] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L120] RET updateLastVariables() [L121] CALL updateVariables() [L83] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L84] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L85] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L86] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L88] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L89] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ulong() [L90] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 12) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 12) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L92] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L93] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L94] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 11) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 11) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L95] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L96] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L97] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L98] WrapperStruct00.var_1_8 = __VERIFIER_nondet_char() [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L100] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L101] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L103] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L104] WrapperStruct00.var_1_12 = __VERIFIER_nondet_long() [L105] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L106] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L107] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_12 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_12 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L121] RET updateVariables() [L122] CALL step() [L55] EXPR WrapperStruct00.var_1_7 [L55] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L55] COND TRUE WrapperStruct00.var_1_7 < WrapperStruct00.var_1_3 [L56] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L56] COND TRUE last_1_WrapperStruct00_var_1_11 > WrapperStruct00.var_1_7 [L57] EXPR WrapperStruct00.var_1_3 [L57] EXPR WrapperStruct00.var_1_8 [L57] WrapperStruct00.var_1_10 = (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8) [L64] EXPR WrapperStruct00.var_1_7 [L64] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_7 [L65] EXPR WrapperStruct00.var_1_2 [L65] EXPR WrapperStruct00.var_1_12 [L65] signed long int stepLocal_1 = WrapperStruct00.var_1_2 / WrapperStruct00.var_1_12; [L66] EXPR WrapperStruct00.var_1_10 [L66] EXPR WrapperStruct00.var_1_13 [L66] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L66] COND FALSE !(((WrapperStruct00.var_1_10 * WrapperStruct00.var_1_13) + WrapperStruct00.var_1_8) > stepLocal_1) [L71] EXPR WrapperStruct00.var_1_7 [L71] WrapperStruct00.var_1_11 = WrapperStruct00.var_1_7 [L73] EXPR WrapperStruct00.var_1_11 [L73] signed long int stepLocal_0 = WrapperStruct00.var_1_11; [L74] EXPR WrapperStruct00.var_1_2 [L74] EXPR WrapperStruct00.var_1_3 [L74] EXPR WrapperStruct00.var_1_4 [L74] EXPR WrapperStruct00.var_1_5 [L74] EXPR (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10, stepLocal_0=-2, stepLocal_1=28] [L74] COND FALSE !(((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= stepLocal_0) [L77] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L77] COND TRUE WrapperStruct00.var_1_9 [L78] EXPR WrapperStruct00.var_1_5 [L78] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_5 [L122] RET step() [L123] CALL, EXPR property() [L113] EXPR WrapperStruct00.var_1_2 [L113] EXPR WrapperStruct00.var_1_3 [L113] EXPR WrapperStruct00.var_1_4 [L113] EXPR WrapperStruct00.var_1_5 [L113] EXPR (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5) [L113] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1) [L113] EXPR WrapperStruct00.var_1_1 [L113] EXPR WrapperStruct00.var_1_4 [L113] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) [L113] EXPR WrapperStruct00.var_1_8 [L113] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR ((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))) [L113] EXPR WrapperStruct00.var_1_4 [L113] EXPR ((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1)) && ((WrapperStruct00.var_1_7 < WrapperStruct00.var_1_3) ? ((last_1_WrapperStruct00_var_1_11 > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))) : 1) : (((WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))) > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8)) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1)) && ((WrapperStruct00.var_1_7 < WrapperStruct00.var_1_3) ? ((last_1_WrapperStruct00_var_1_11 > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))) : 1) : (((WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))) > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8)) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1)) && ((WrapperStruct00.var_1_7 < WrapperStruct00.var_1_3) ? ((last_1_WrapperStruct00_var_1_11 > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))) : 1) : (((WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))) > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8)) : 1))) && ((((WrapperStruct00.var_1_10 * WrapperStruct00.var_1_13) + WrapperStruct00.var_1_8) > (WrapperStruct00.var_1_2 / WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_2)) : 1) : (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_7))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1)) && ((WrapperStruct00.var_1_7 < WrapperStruct00.var_1_3) ? ((last_1_WrapperStruct00_var_1_11 > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))) : 1) : (((WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))) > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8)) : 1))) && ((((WrapperStruct00.var_1_10 * WrapperStruct00.var_1_13) + WrapperStruct00.var_1_8) > (WrapperStruct00.var_1_2 / WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_2)) : 1) : (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_7))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR ((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1)) && ((WrapperStruct00.var_1_7 < WrapperStruct00.var_1_3) ? ((last_1_WrapperStruct00_var_1_11 > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))) : 1) : (((WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))) > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8)) : 1))) && ((((WrapperStruct00.var_1_10 * WrapperStruct00.var_1_13) + WrapperStruct00.var_1_8) > (WrapperStruct00.var_1_2 / WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_2)) : 1) : (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR ((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1)) && ((WrapperStruct00.var_1_7 < WrapperStruct00.var_1_3) ? ((last_1_WrapperStruct00_var_1_11 > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))) : 1) : (((WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))) > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8)) : 1))) && ((((WrapperStruct00.var_1_10 * WrapperStruct00.var_1_13) + WrapperStruct00.var_1_8) > (WrapperStruct00.var_1_2 / WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_2)) : 1) : (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113-L114] return ((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1)) && ((WrapperStruct00.var_1_7 < WrapperStruct00.var_1_3) ? ((last_1_WrapperStruct00_var_1_11 > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))) : 1) : (((WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))) > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8)) : 1))) && ((((WrapperStruct00.var_1_10 * WrapperStruct00.var_1_13) + WrapperStruct00.var_1_8) > (WrapperStruct00.var_1_2 / WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_2)) : 1) : (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) ; [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_11=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 315 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 315 mSDsluCounter, 1659 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1075 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 576 IncrementalHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 584 mSDtfsCounter, 576 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 623 GetRequests, 601 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 106 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 615 ConstructedInterpolants, 0 QuantifiedInterpolants, 1003 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1511 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 2675/2720 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 [2023-12-21 02:21:30,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...