/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-46.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:24:22,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:24:22,329 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:24:22,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:24:22,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:24:22,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:24:22,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:24:22,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:24:22,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:24:22,364 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:24:22,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:24:22,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:24:22,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:24:22,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:24:22,365 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:24:22,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:24:22,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:24:22,366 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:24:22,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:24:22,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:24:22,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:24:22,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:24:22,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:24:22,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:24:22,373 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:24:22,373 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:24:22,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:24:22,374 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:24:22,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:24:22,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:24:22,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:24:22,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:24:22,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:24:22,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:24:22,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:24:22,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:24:22,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:24:22,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:24:22,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:24:22,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:24:22,377 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:24:22,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:24:22,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:24:22,377 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:24:22,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:24:22,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:24:22,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:24:22,593 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:24:22,593 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:24:22,594 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-46.i [2023-12-21 02:24:23,594 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:24:23,743 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:24:23,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-46.i [2023-12-21 02:24:23,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1721f9d3e/cc13b4a38ddf41deb4cd4523d08c3bf2/FLAG644a9834e [2023-12-21 02:24:23,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1721f9d3e/cc13b4a38ddf41deb4cd4523d08c3bf2 [2023-12-21 02:24:23,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:24:23,762 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:24:23,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:24:23,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:24:23,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:24:23,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:24:23" (1/1) ... [2023-12-21 02:24:23,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcd7bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:23, skipping insertion in model container [2023-12-21 02:24:23,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:24:23" (1/1) ... [2023-12-21 02:24:23,790 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:24:23,898 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-46.i[916,929] [2023-12-21 02:24:23,927 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:24:23,935 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:24:23,943 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-46.i[916,929] [2023-12-21 02:24:23,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:24:23,990 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:24:23,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:23 WrapperNode [2023-12-21 02:24:23,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:24:23,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:24:23,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:24:23,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:24:23,995 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:24:23" (1/1) ... [2023-12-21 02:24:24,004 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:24:23" (1/1) ... [2023-12-21 02:24:24,049 INFO L138 Inliner]: procedures = 29, calls = 127, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 384 [2023-12-21 02:24:24,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:24:24,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:24:24,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:24:24,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:24:24,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:23" (1/1) ... [2023-12-21 02:24:24,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:23" (1/1) ... [2023-12-21 02:24:24,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:23" (1/1) ... [2023-12-21 02:24:24,085 INFO L175 MemorySlicer]: Split 101 memory accesses to 2 slices as follows [2, 99]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 16 writes are split as follows [0, 16]. [2023-12-21 02:24:24,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:23" (1/1) ... [2023-12-21 02:24:24,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:23" (1/1) ... [2023-12-21 02:24:24,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:23" (1/1) ... [2023-12-21 02:24:24,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:23" (1/1) ... [2023-12-21 02:24:24,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:23" (1/1) ... [2023-12-21 02:24:24,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:23" (1/1) ... [2023-12-21 02:24:24,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:24:24,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:24:24,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:24:24,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:24:24,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:23" (1/1) ... [2023-12-21 02:24:24,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:24:24,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:24:24,163 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:24:24,171 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:24:24,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:24:24,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 02:24:24,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 02:24:24,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:24:24,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:24:24,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 02:24:24,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 02:24:24,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:24:24,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:24:24,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 02:24:24,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 02:24:24,189 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:24:24,190 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:24:24,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:24:24,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:24:24,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:24:24,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:24:24,280 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:24:24,284 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:24:24,555 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:24:24,586 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:24:24,587 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:24:24,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:24:24 BoogieIcfgContainer [2023-12-21 02:24:24,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:24:24,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:24:24,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:24:24,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:24:24,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:24:23" (1/3) ... [2023-12-21 02:24:24,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e755b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:24:24, skipping insertion in model container [2023-12-21 02:24:24,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:24:23" (2/3) ... [2023-12-21 02:24:24,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e755b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:24:24, skipping insertion in model container [2023-12-21 02:24:24,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:24:24" (3/3) ... [2023-12-21 02:24:24,593 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-46.i [2023-12-21 02:24:24,604 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:24:24,605 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:24:24,640 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:24:24,644 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;@7f0eb661, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:24:24,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:24:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 70 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 02:24:24,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-21 02:24:24,660 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:24:24,661 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:24:24,661 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:24:24,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:24:24,666 INFO L85 PathProgramCache]: Analyzing trace with hash 458721636, now seen corresponding path program 1 times [2023-12-21 02:24:24,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:24:24,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981778688] [2023-12-21 02:24:24,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:24,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:24:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:24,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:24:24,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981778688] [2023-12-21 02:24:24,854 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-21 02:24:24,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546281367] [2023-12-21 02:24:24,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:24,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:24:24,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:24:24,858 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:24:24,859 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:24:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:24,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 02:24:25,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:24:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2023-12-21 02:24:25,052 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 02:24:25,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546281367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:24:25,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:24:25,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:24:25,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962317620] [2023-12-21 02:24:25,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:24:25,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:24:25,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:24:25,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:24:25,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:24:25,088 INFO L87 Difference]: Start difference. First operand has 86 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 70 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 02:24:25,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:24:25,136 INFO L93 Difference]: Finished difference Result 169 states and 268 transitions. [2023-12-21 02:24:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:24:25,138 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2023-12-21 02:24:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:24:25,144 INFO L225 Difference]: With dead ends: 169 [2023-12-21 02:24:25,144 INFO L226 Difference]: Without dead ends: 84 [2023-12-21 02:24:25,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:24:25,149 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:24:25,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:24:25,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-21 02:24:25,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-12-21 02:24:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 02:24:25,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2023-12-21 02:24:25,178 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 109 [2023-12-21 02:24:25,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:24:25,178 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2023-12-21 02:24:25,178 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 02:24:25,178 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2023-12-21 02:24:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-21 02:24:25,180 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:24:25,180 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:24:25,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 02:24:25,389 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:24:25,390 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:24:25,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:24:25,391 INFO L85 PathProgramCache]: Analyzing trace with hash 476584520, now seen corresponding path program 1 times [2023-12-21 02:24:25,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:24:25,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013817036] [2023-12-21 02:24:25,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:25,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:24:25,461 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:24:25,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [82040732] [2023-12-21 02:24:25,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:25,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:24:25,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:24:25,462 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:24:25,489 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:24:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:25,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 02:24:25,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:24:25,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-21 02:24:25,661 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 31 treesize of output 15 [2023-12-21 02:24:25,690 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 31 treesize of output 15 [2023-12-21 02:24:25,710 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 31 treesize of output 15 [2023-12-21 02:24:25,731 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 31 treesize of output 15 [2023-12-21 02:24:25,751 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 31 treesize of output 15 [2023-12-21 02:24:25,771 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 31 treesize of output 15 [2023-12-21 02:24:25,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:24:25,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 29 [2023-12-21 02:24:25,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:24:25,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 29 [2023-12-21 02:24:25,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:24:25,850 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 38 treesize of output 14 [2023-12-21 02:24:25,858 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-21 02:24:25,858 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 02:24:25,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:24:25,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013817036] [2023-12-21 02:24:25,859 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:24:25,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82040732] [2023-12-21 02:24:25,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82040732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:24:25,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:24:25,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:24:25,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640480198] [2023-12-21 02:24:25,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:24:25,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:24:25,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:24:25,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:24:25,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:24:25,861 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 02:24:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:24:26,275 INFO L93 Difference]: Finished difference Result 303 states and 443 transitions. [2023-12-21 02:24:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:24:26,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2023-12-21 02:24:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:24:26,277 INFO L225 Difference]: With dead ends: 303 [2023-12-21 02:24:26,277 INFO L226 Difference]: Without dead ends: 220 [2023-12-21 02:24:26,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:24:26,279 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 178 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 02:24:26,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 294 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 02:24:26,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-12-21 02:24:26,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 215. [2023-12-21 02:24:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 182 states have (on average 1.4230769230769231) internal successors, (259), 183 states have internal predecessors, (259), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-21 02:24:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 317 transitions. [2023-12-21 02:24:26,318 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 317 transitions. Word has length 109 [2023-12-21 02:24:26,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:24:26,319 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 317 transitions. [2023-12-21 02:24:26,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 02:24:26,320 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 317 transitions. [2023-12-21 02:24:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-21 02:24:26,323 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:24:26,323 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:24:26,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-21 02:24:26,524 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:24:26,524 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:24:26,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:24:26,525 INFO L85 PathProgramCache]: Analyzing trace with hash 734749958, now seen corresponding path program 1 times [2023-12-21 02:24:26,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:24:26,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839087360] [2023-12-21 02:24:26,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:26,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:24:26,577 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:24:26,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172670328] [2023-12-21 02:24:26,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:26,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:24:26,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:24:26,617 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:24:26,619 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:24:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:26,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 02:24:26,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:24:26,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 02:24:26,802 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 27 treesize of output 11 [2023-12-21 02:24:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-21 02:24:26,830 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:24:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-21 02:24:26,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:24:26,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839087360] [2023-12-21 02:24:26,910 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:24:26,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172670328] [2023-12-21 02:24:26,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172670328] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:24:26,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:24:26,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2023-12-21 02:24:26,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042907677] [2023-12-21 02:24:26,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:24:26,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:24:26,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:24:26,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:24:26,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:24:26,919 INFO L87 Difference]: Start difference. First operand 215 states and 317 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 02:24:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:24:27,142 INFO L93 Difference]: Finished difference Result 688 states and 1015 transitions. [2023-12-21 02:24:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:24:27,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2023-12-21 02:24:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:24:27,147 INFO L225 Difference]: With dead ends: 688 [2023-12-21 02:24:27,147 INFO L226 Difference]: Without dead ends: 474 [2023-12-21 02:24:27,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:24:27,149 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 148 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:24:27,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 314 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:24:27,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2023-12-21 02:24:27,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 239. [2023-12-21 02:24:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 206 states have (on average 1.412621359223301) internal successors, (291), 207 states have internal predecessors, (291), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-21 02:24:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 349 transitions. [2023-12-21 02:24:27,180 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 349 transitions. Word has length 109 [2023-12-21 02:24:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:24:27,180 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 349 transitions. [2023-12-21 02:24:27,180 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 02:24:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 349 transitions. [2023-12-21 02:24:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-21 02:24:27,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:24:27,182 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:24:27,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-21 02:24:27,387 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:24:27,387 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:24:27,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:24:27,388 INFO L85 PathProgramCache]: Analyzing trace with hash 188451451, now seen corresponding path program 1 times [2023-12-21 02:24:27,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:24:27,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283776902] [2023-12-21 02:24:27,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:27,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:24:27,411 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:24:27,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [263551240] [2023-12-21 02:24:27,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:27,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:24:27,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:24:27,429 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:24:27,460 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:24:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:24:27,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-21 02:24:27,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:24:27,600 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 31 treesize of output 15 [2023-12-21 02:24:27,616 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 31 treesize of output 15 [2023-12-21 02:24:27,647 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 31 treesize of output 15 [2023-12-21 02:24:27,666 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 31 treesize of output 15 [2023-12-21 02:24:27,684 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 31 treesize of output 15 [2023-12-21 02:24:27,702 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 31 treesize of output 15 [2023-12-21 02:24:27,721 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 31 treesize of output 15 [2023-12-21 02:24:27,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:24:27,819 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 57 treesize of output 21 [2023-12-21 02:24:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-21 02:24:27,858 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 02:24:27,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:24:27,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283776902] [2023-12-21 02:24:27,859 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:24:27,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263551240] [2023-12-21 02:24:27,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263551240] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:24:27,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:24:27,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:24:27,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274514714] [2023-12-21 02:24:27,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:24:27,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:24:27,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:24:27,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:24:27,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:24:27,860 INFO L87 Difference]: Start difference. First operand 239 states and 349 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 02:24:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:24:28,641 INFO L93 Difference]: Finished difference Result 481 states and 698 transitions. [2023-12-21 02:24:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:24:28,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2023-12-21 02:24:28,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:24:28,643 INFO L225 Difference]: With dead ends: 481 [2023-12-21 02:24:28,643 INFO L226 Difference]: Without dead ends: 243 [2023-12-21 02:24:28,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:24:28,644 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 170 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 02:24:28,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 338 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 02:24:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-12-21 02:24:28,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 238. [2023-12-21 02:24:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 205 states have (on average 1.4048780487804877) internal successors, (288), 206 states have internal predecessors, (288), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-21 02:24:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 346 transitions. [2023-12-21 02:24:28,671 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 346 transitions. Word has length 111 [2023-12-21 02:24:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:24:28,672 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 346 transitions. [2023-12-21 02:24:28,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 02:24:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 346 transitions. [2023-12-21 02:24:28,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-21 02:24:28,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:24:28,685 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:24:28,708 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:24:28,891 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:24:28,892 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:24:28,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:24:28,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1452788893, now seen corresponding path program 1 times [2023-12-21 02:24:28,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:24:28,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291048378] [2023-12-21 02:24:28,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:24:28,913 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:24:28,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [671539617] [2023-12-21 02:24:28,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:24:28,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:24:28,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:24:28,915 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:24:28,918 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:24:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:24:29,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 02:24:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:24:29,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 02:24:29,288 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 02:24:29,289 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:24:29,300 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:24:29,497 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:24:29,500 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-21 02:24:29,503 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:24:29,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:24:29 BoogieIcfgContainer [2023-12-21 02:24:29,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:24:29,549 INFO L158 Benchmark]: Toolchain (without parser) took 5787.21ms. Allocated memory was 335.5MB in the beginning and 526.4MB in the end (delta: 190.8MB). Free memory was 291.4MB in the beginning and 407.1MB in the end (delta: -115.6MB). Peak memory consumption was 76.4MB. Max. memory is 8.0GB. [2023-12-21 02:24:29,549 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 174.1MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:24:29,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.21ms. Allocated memory is still 335.5MB. Free memory was 291.1MB in the beginning and 276.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 02:24:29,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.77ms. Allocated memory is still 335.5MB. Free memory was 275.9MB in the beginning and 272.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 02:24:29,549 INFO L158 Benchmark]: Boogie Preprocessor took 86.66ms. Allocated memory is still 335.5MB. Free memory was 272.8MB in the beginning and 268.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:24:29,550 INFO L158 Benchmark]: RCFGBuilder took 449.48ms. Allocated memory is still 335.5MB. Free memory was 268.6MB in the beginning and 240.3MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-12-21 02:24:29,550 INFO L158 Benchmark]: TraceAbstraction took 4959.93ms. Allocated memory was 335.5MB in the beginning and 526.4MB in the end (delta: 190.8MB). Free memory was 239.2MB in the beginning and 407.1MB in the end (delta: -167.9MB). Peak memory consumption was 23.9MB. Max. memory is 8.0GB. [2023-12-21 02:24:29,551 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.56ms. Allocated memory is still 174.1MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.21ms. Allocated memory is still 335.5MB. Free memory was 291.1MB in the beginning and 276.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.77ms. Allocated memory is still 335.5MB. Free memory was 275.9MB in the beginning and 272.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 86.66ms. Allocated memory is still 335.5MB. Free memory was 272.8MB in the beginning and 268.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 449.48ms. Allocated memory is still 335.5MB. Free memory was 268.6MB in the beginning and 240.3MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 4959.93ms. Allocated memory was 335.5MB in the beginning and 526.4MB in the end (delta: 190.8MB). Free memory was 239.2MB in the beginning and 407.1MB in the end (delta: -167.9MB). Peak memory consumption was 23.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 someBinaryDOUBLEComparisonOperation at line 116, overapproximation of bitwise operation at line 116. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { 1, 31.75, -8, 0, 0, 1, 1, -4, 32, -25, 4 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { 1, 31.75, -8, 0, 0, 1, 1, -4, 32, -25, 4 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { 1, 31.75, -8, 0, 0, 1, 1, -4, 32, -25, 4 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { 1, 31.75, -8, 0, 0, 1, 1, -4, 32, -25, 4 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { 1, 31.75, -8, 0, 0, 1, 1, -4, 32, -25, 4 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { 1, 31.75, -8, 0, 0, 1, 1, -4, 32, -25, 4 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { 1, 31.75, -8, 0, 0, 1, 1, -4, 32, -25, 4 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { 1, 31.75, -8, 0, 0, 1, 1, -4, 32, -25, 4 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { 1, 31.75, -8, 0, 0, 1, 1, -4, 32, -25, 4 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { 1, 31.75, -8, 0, 0, 1, 1, -4, 32, -25, 4 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { 1, 31.75, -8, 0, 0, 1, 1, -4, 32, -25, 4 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { 1, 31.75, -8, 0, 0, 1, 1, -4, 32, -25, 4 }; [L49] unsigned char last_1_WrapperStruct00_var_1_1 = 1; [L50] signed short int last_1_WrapperStruct00_var_1_10 = -4; [L120] isInitial = 1 [L121] FCALL initially() [L122] COND TRUE 1 [L123] CALL updateLastVariables() [L112] EXPR WrapperStruct00.var_1_1 [L112] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L113] EXPR WrapperStruct00.var_1_10 [L113] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L123] RET updateLastVariables() [L124] CALL updateVariables() [L89] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L90] EXPR WrapperStruct00.var_1_2 [L90] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L90] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_2 [L90] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L90] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L90] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L91] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -128) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -128) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L93] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L94] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L95] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L97] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L98] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L100] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [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_10=-4, last_1_WrapperStruct00_var_1_1=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L103] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [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_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L104] WrapperStruct00.var_1_12 = __VERIFIER_nondet_short() [L105] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L106] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L107] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L108] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L109] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L124] RET updateVariables() [L125] CALL step() [L54] EXPR WrapperStruct00.var_1_12 [L54] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L54] COND FALSE !(last_1_WrapperStruct00_var_1_10 <= (WrapperStruct00.var_1_12 / WrapperStruct00.var_1_4)) [L59] EXPR WrapperStruct00.var_1_4 [L59] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L59] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13) [L59] EXPR WrapperStruct00.var_1_4 [L59] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L59] signed long int stepLocal_1 = (((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13)); [L60] EXPR WrapperStruct00.var_1_13 [L60] EXPR WrapperStruct00.var_1_4 [L60] signed long int stepLocal_0 = WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4; [L61] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L61] COND TRUE (- WrapperStruct00.var_1_2) >= 16.75 [L62] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L62] COND TRUE stepLocal_0 >= WrapperStruct00.var_1_13 [L63] COND TRUE stepLocal_1 > -32 [L64] WrapperStruct00.var_1_1 = 0 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L78] EXPR WrapperStruct00.var_1_13 [L78] signed char stepLocal_2 = WrapperStruct00.var_1_13; [L79] EXPR WrapperStruct00.var_1_13 [L79] EXPR WrapperStruct00.var_1_13 [L79] EXPR WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13 [L79] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L79] COND FALSE !(((WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13) + WrapperStruct00.var_1_4) < stepLocal_2) [L82] WrapperStruct00.var_1_10 = 128 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L84] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L84] COND FALSE !(1 == WrapperStruct00.var_1_4) [L125] RET step() [L126] CALL, EXPR property() [L116] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] EXPR ((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1)) [L116] EXPR WrapperStruct00.var_1_1 [L116] EXPR ((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] EXPR (((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1))) && ((1 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_9)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] EXPR (((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1))) && ((1 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_9)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] EXPR ((((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1))) && ((1 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_9)) : 1)) && ((((WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13) + WrapperStruct00.var_1_4) < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_10 == ((signed short int) (WrapperStruct00.var_1_12 - 256))) : (WrapperStruct00.var_1_10 == ((signed short int) 128))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] EXPR ((((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1))) && ((1 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_9)) : 1)) && ((((WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13) + WrapperStruct00.var_1_4) < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_10 == ((signed short int) (WrapperStruct00.var_1_12 - 256))) : (WrapperStruct00.var_1_10 == ((signed short int) 128))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] EXPR (((((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1))) && ((1 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_9)) : 1)) && ((((WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13) + WrapperStruct00.var_1_4) < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_10 == ((signed short int) (WrapperStruct00.var_1_12 - 256))) : (WrapperStruct00.var_1_10 == ((signed short int) 128)))) && ((last_1_WrapperStruct00_var_1_10 <= (WrapperStruct00.var_1_12 / WrapperStruct00.var_1_4)) ? (last_1_WrapperStruct00_var_1_1 ? (WrapperStruct00.var_1_13 == ((signed char) WrapperStruct00.var_1_16)) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] EXPR (((((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1))) && ((1 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_9)) : 1)) && ((((WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13) + WrapperStruct00.var_1_4) < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_10 == ((signed short int) (WrapperStruct00.var_1_12 - 256))) : (WrapperStruct00.var_1_10 == ((signed short int) 128)))) && ((last_1_WrapperStruct00_var_1_10 <= (WrapperStruct00.var_1_12 / WrapperStruct00.var_1_4)) ? (last_1_WrapperStruct00_var_1_1 ? (WrapperStruct00.var_1_13 == ((signed char) WrapperStruct00.var_1_16)) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116-L117] return (((((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1))) && ((1 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_9)) : 1)) && ((((WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13) + WrapperStruct00.var_1_4) < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_10 == ((signed short int) (WrapperStruct00.var_1_12 - 256))) : (WrapperStruct00.var_1_10 == ((signed short int) 128)))) && ((last_1_WrapperStruct00_var_1_10 <= (WrapperStruct00.var_1_12 / WrapperStruct00.var_1_4)) ? (last_1_WrapperStruct00_var_1_1 ? (WrapperStruct00.var_1_13 == ((signed char) WrapperStruct00.var_1_16)) : 1) : 1) ; [L126] RET, EXPR property() [L126] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 496 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 1065 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 714 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1059 IncrementalHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 351 mSDtfsCounter, 1059 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 549 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=3, 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, 245 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 658 NumberOfCodeBlocks, 658 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 542 ConstructedInterpolants, 1 QuantifiedInterpolants, 2737 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1461 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 1793/1820 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-21 02:24:29,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...