/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-30.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:39:56,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:39:56,327 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-15 21:39:56,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:39:56,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:39:56,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:39:56,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:39:56,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:39:56,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:39:56,350 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:39:56,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:39:56,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:39:56,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:39:56,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:39:56,351 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:39:56,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:39:56,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:39:56,352 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:39:56,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:39:56,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:39:56,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:39:56,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:39:56,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:39:56,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:39:56,360 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:39:56,360 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:39:56,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:39:56,361 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:39:56,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:39:56,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:39:56,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:39:56,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:39:56,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:39:56,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:39:56,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:39:56,363 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:39:56,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:39:56,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:39:56,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:39:56,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:39:56,363 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:39:56,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:39:56,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:39:56,364 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 -> true [2023-12-15 21:39:56,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:39:56,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:39:56,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:39:56,573 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:39:56,573 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:39:56,574 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-30.i [2023-12-15 21:39:57,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:39:57,803 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:39:57,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-30.i [2023-12-15 21:39:57,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7cc74eb1/20f06e3daa314d2793f69e1175977d58/FLAG17f4de45d [2023-12-15 21:39:57,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7cc74eb1/20f06e3daa314d2793f69e1175977d58 [2023-12-15 21:39:57,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:39:57,824 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:39:57,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:39:57,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:39:57,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:39:57,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:39:57" (1/1) ... [2023-12-15 21:39:57,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ffe5c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:57, skipping insertion in model container [2023-12-15 21:39:57,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:39:57" (1/1) ... [2023-12-15 21:39:57,848 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:39:57,951 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-30.i[916,929] [2023-12-15 21:39:57,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:39:57,999 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:39:58,007 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-30.i[916,929] [2023-12-15 21:39:58,030 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:39:58,043 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:39:58,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:58 WrapperNode [2023-12-15 21:39:58,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:39:58,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:39:58,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:39:58,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:39:58,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:58" (1/1) ... [2023-12-15 21:39:58,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:58" (1/1) ... [2023-12-15 21:39:58,100 INFO L138 Inliner]: procedures = 29, calls = 168, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 512 [2023-12-15 21:39:58,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:39:58,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:39:58,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:39:58,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:39:58,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:58" (1/1) ... [2023-12-15 21:39:58,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:58" (1/1) ... [2023-12-15 21:39:58,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:58" (1/1) ... [2023-12-15 21:39:58,126 INFO L175 MemorySlicer]: Split 139 memory accesses to 2 slices as follows [2, 137]. 99 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 13]. The 17 writes are split as follows [0, 17]. [2023-12-15 21:39:58,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:58" (1/1) ... [2023-12-15 21:39:58,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:58" (1/1) ... [2023-12-15 21:39:58,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:58" (1/1) ... [2023-12-15 21:39:58,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:58" (1/1) ... [2023-12-15 21:39:58,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:58" (1/1) ... [2023-12-15 21:39:58,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:58" (1/1) ... [2023-12-15 21:39:58,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:39:58,152 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:39:58,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:39:58,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:39:58,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:58" (1/1) ... [2023-12-15 21:39:58,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:39:58,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:39:58,188 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-15 21:39:58,236 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-15 21:39:58,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:39:58,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:39:58,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:39:58,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:39:58,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:39:58,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:39:58,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:39:58,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:39:58,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:39:58,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:39:58,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:39:58,245 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:39:58,245 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:39:58,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:39:58,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:39:58,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:39:58,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:39:58,358 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:39:58,359 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:39:58,806 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:39:58,836 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:39:58,836 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:39:58,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:39:58 BoogieIcfgContainer [2023-12-15 21:39:58,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:39:58,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:39:58,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:39:58,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:39:58,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:39:57" (1/3) ... [2023-12-15 21:39:58,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8516bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:39:58, skipping insertion in model container [2023-12-15 21:39:58,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:58" (2/3) ... [2023-12-15 21:39:58,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8516bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:39:58, skipping insertion in model container [2023-12-15 21:39:58,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:39:58" (3/3) ... [2023-12-15 21:39:58,844 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-30.i [2023-12-15 21:39:58,855 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:39:58,856 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:39:58,901 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:39:58,905 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;@4d9dff79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:39:58,905 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:39:58,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 91 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-15 21:39:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-15 21:39:58,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:39:58,924 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:39:58,925 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:39:58,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:39:58,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1263132150, now seen corresponding path program 1 times [2023-12-15 21:39:58,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:39:58,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206662471] [2023-12-15 21:39:58,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:39:58,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:39:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:39:59,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:39:59,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206662471] [2023-12-15 21:39:59,119 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-15 21:39:59,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33177098] [2023-12-15 21:39:59,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:39:59,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:39:59,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:39:59,134 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-15 21:39:59,134 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-15 21:39:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:39:59,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-15 21:39:59,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:39:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2023-12-15 21:39:59,370 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:39:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33177098] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:39:59,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:39:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:39:59,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652598901] [2023-12-15 21:39:59,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:39:59,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:39:59,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:39:59,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:39:59,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:39:59,404 INFO L87 Difference]: Start difference. First operand has 110 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 91 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-15 21:39:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:39:59,451 INFO L93 Difference]: Finished difference Result 217 states and 345 transitions. [2023-12-15 21:39:59,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:39:59,453 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2023-12-15 21:39:59,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:39:59,459 INFO L225 Difference]: With dead ends: 217 [2023-12-15 21:39:59,459 INFO L226 Difference]: Without dead ends: 108 [2023-12-15 21:39:59,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-15 21:39:59,465 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:39:59,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:39:59,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-15 21:39:59,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-12-15 21:39:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 89 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-15 21:39:59,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2023-12-15 21:39:59,517 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 132 [2023-12-15 21:39:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:39:59,517 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2023-12-15 21:39:59,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-15 21:39:59,518 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2023-12-15 21:39:59,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-15 21:39:59,525 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:39:59,525 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:39:59,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 21:39:59,738 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-15 21:39:59,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:39:59,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:39:59,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2080203292, now seen corresponding path program 1 times [2023-12-15 21:39:59,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:39:59,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484846080] [2023-12-15 21:39:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:39:59,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:39:59,844 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:39:59,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1285596054] [2023-12-15 21:39:59,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:39:59,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:39:59,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:39:59,846 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-15 21:39:59,885 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-15 21:40:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:00,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 21:40:00,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:40:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:40:00,059 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:40:00,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:40:00,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484846080] [2023-12-15 21:40:00,060 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:40:00,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285596054] [2023-12-15 21:40:00,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285596054] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:40:00,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:40:00,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:40:00,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343638395] [2023-12-15 21:40:00,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:40:00,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:40:00,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:40:00,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:40:00,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:40:00,062 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:00,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:40:00,127 INFO L93 Difference]: Finished difference Result 219 states and 324 transitions. [2023-12-15 21:40:00,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:40:00,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2023-12-15 21:40:00,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:40:00,129 INFO L225 Difference]: With dead ends: 219 [2023-12-15 21:40:00,129 INFO L226 Difference]: Without dead ends: 112 [2023-12-15 21:40:00,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:40:00,130 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 3 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:40:00,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 455 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:40:00,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-15 21:40:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2023-12-15 21:40:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 91 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-15 21:40:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2023-12-15 21:40:00,138 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 132 [2023-12-15 21:40:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:40:00,139 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2023-12-15 21:40:00,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2023-12-15 21:40:00,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-15 21:40:00,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:00,141 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:40:00,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 21:40:00,341 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-15 21:40:00,342 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:00,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:00,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2080262874, now seen corresponding path program 1 times [2023-12-15 21:40:00,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:00,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133502024] [2023-12-15 21:40:00,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:00,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:00,436 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:40:00,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2116245712] [2023-12-15 21:40:00,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:00,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:40:00,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:40:00,440 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-15 21:40:00,441 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-15 21:40:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:00,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-15 21:40:00,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:40:00,659 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 17 treesize of output 17 [2023-12-15 21:40:00,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:00,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2023-12-15 21:40:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:40:00,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:40:00,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:40:00,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133502024] [2023-12-15 21:40:00,751 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:40:00,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116245712] [2023-12-15 21:40:00,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116245712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:40:00,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:40:00,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:40:00,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963615036] [2023-12-15 21:40:00,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:40:00,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:40:00,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:40:00,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:40:00,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:40:00,753 INFO L87 Difference]: Start difference. First operand 110 states and 162 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:40:01,094 INFO L93 Difference]: Finished difference Result 366 states and 532 transitions. [2023-12-15 21:40:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:40:01,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2023-12-15 21:40:01,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:40:01,096 INFO L225 Difference]: With dead ends: 366 [2023-12-15 21:40:01,096 INFO L226 Difference]: Without dead ends: 257 [2023-12-15 21:40:01,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:40:01,098 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 246 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:40:01,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 284 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:40:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-12-15 21:40:01,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 187. [2023-12-15 21:40:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 155 states have (on average 1.3935483870967742) internal successors, (216), 156 states have internal predecessors, (216), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-15 21:40:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 274 transitions. [2023-12-15 21:40:01,111 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 274 transitions. Word has length 132 [2023-12-15 21:40:01,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:40:01,112 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 274 transitions. [2023-12-15 21:40:01,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:01,112 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 274 transitions. [2023-12-15 21:40:01,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-15 21:40:01,113 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:01,113 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:40:01,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 21:40:01,318 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-15 21:40:01,320 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:01,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:01,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1680815011, now seen corresponding path program 1 times [2023-12-15 21:40:01,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:01,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388250987] [2023-12-15 21:40:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:01,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:01,393 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:40:01,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [474574672] [2023-12-15 21:40:01,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:01,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:40:01,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:40:01,410 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-15 21:40:01,436 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-15 21:40:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:01,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-15 21:40:01,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:40:01,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:01,576 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 19 treesize of output 7 [2023-12-15 21:40:01,593 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 17 treesize of output 17 [2023-12-15 21:40:01,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:01,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2023-12-15 21:40:01,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:01,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 34 [2023-12-15 21:40:01,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:01,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 34 [2023-12-15 21:40:01,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:01,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 33 [2023-12-15 21:40:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-15 21:40:01,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:40:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:40:01,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:40:01,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388250987] [2023-12-15 21:40:01,786 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:40:01,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474574672] [2023-12-15 21:40:01,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474574672] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 21:40:01,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:40:01,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2023-12-15 21:40:01,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379124833] [2023-12-15 21:40:01,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:40:01,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:40:01,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:40:01,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:40:01,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:40:01,792 INFO L87 Difference]: Start difference. First operand 187 states and 274 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:40:02,046 INFO L93 Difference]: Finished difference Result 398 states and 581 transitions. [2023-12-15 21:40:02,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:40:02,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2023-12-15 21:40:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:40:02,048 INFO L225 Difference]: With dead ends: 398 [2023-12-15 21:40:02,048 INFO L226 Difference]: Without dead ends: 212 [2023-12-15 21:40:02,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:40:02,049 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 163 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:40:02,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 578 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:40:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-12-15 21:40:02,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 189. [2023-12-15 21:40:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 157 states have (on average 1.3885350318471337) internal successors, (218), 158 states have internal predecessors, (218), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-15 21:40:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 276 transitions. [2023-12-15 21:40:02,060 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 276 transitions. Word has length 133 [2023-12-15 21:40:02,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:40:02,060 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 276 transitions. [2023-12-15 21:40:02,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 276 transitions. [2023-12-15 21:40:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-15 21:40:02,061 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:02,061 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:40:02,067 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-15 21:40:02,267 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-15 21:40:02,267 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:02,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:02,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1058471699, now seen corresponding path program 1 times [2023-12-15 21:40:02,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:02,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282615126] [2023-12-15 21:40:02,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:02,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:02,292 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:40:02,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1752275429] [2023-12-15 21:40:02,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:02,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:40:02,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:40:02,294 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-15 21:40:02,319 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-15 21:40:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:02,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-15 21:40:02,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:40:02,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:02,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2023-12-15 21:40:02,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:02,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2023-12-15 21:40:02,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:02,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 15 [2023-12-15 21:40:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:40:02,543 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:40:02,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:40:02,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282615126] [2023-12-15 21:40:02,543 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:40:02,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752275429] [2023-12-15 21:40:02,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752275429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:40:02,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:40:02,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:40:02,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121127360] [2023-12-15 21:40:02,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:40:02,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:40:02,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:40:02,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:40:02,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:40:02,545 INFO L87 Difference]: Start difference. First operand 189 states and 276 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:40:02,871 INFO L93 Difference]: Finished difference Result 444 states and 645 transitions. [2023-12-15 21:40:02,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:40:02,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2023-12-15 21:40:02,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:40:02,874 INFO L225 Difference]: With dead ends: 444 [2023-12-15 21:40:02,874 INFO L226 Difference]: Without dead ends: 256 [2023-12-15 21:40:02,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:40:02,875 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 213 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:40:02,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 580 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:40:02,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-12-15 21:40:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 189. [2023-12-15 21:40:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 157 states have (on average 1.3821656050955413) internal successors, (217), 158 states have internal predecessors, (217), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-15 21:40:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 275 transitions. [2023-12-15 21:40:02,884 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 275 transitions. Word has length 133 [2023-12-15 21:40:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:40:02,885 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 275 transitions. [2023-12-15 21:40:02,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 275 transitions. [2023-12-15 21:40:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-15 21:40:02,886 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:02,886 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:40:02,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-15 21:40:03,092 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-15 21:40:03,092 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:03,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:03,093 INFO L85 PathProgramCache]: Analyzing trace with hash -858453294, now seen corresponding path program 1 times [2023-12-15 21:40:03,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:03,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083058169] [2023-12-15 21:40:03,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:03,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:03,137 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:40:03,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059907531] [2023-12-15 21:40:03,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:03,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:40:03,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:40:03,156 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:40:03,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-15 21:40:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:03,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-15 21:40:03,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:40:03,409 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 17 treesize of output 17 [2023-12-15 21:40:03,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:03,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2023-12-15 21:40:03,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:03,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 34 [2023-12-15 21:40:03,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:03,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 34 [2023-12-15 21:40:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-15 21:40:03,559 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:40:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:40:03,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:40:03,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083058169] [2023-12-15 21:40:03,699 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:40:03,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059907531] [2023-12-15 21:40:03,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059907531] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 21:40:03,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:40:03,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 16 [2023-12-15 21:40:03,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366930052] [2023-12-15 21:40:03,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:40:03,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:40:03,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:40:03,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:40:03,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:40:03,700 INFO L87 Difference]: Start difference. First operand 189 states and 275 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:40:04,429 INFO L93 Difference]: Finished difference Result 739 states and 1062 transitions. [2023-12-15 21:40:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-15 21:40:04,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2023-12-15 21:40:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:40:04,431 INFO L225 Difference]: With dead ends: 739 [2023-12-15 21:40:04,431 INFO L226 Difference]: Without dead ends: 551 [2023-12-15 21:40:04,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2023-12-15 21:40:04,433 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 452 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:40:04,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 809 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:40:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2023-12-15 21:40:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 235. [2023-12-15 21:40:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 203 states have (on average 1.3891625615763548) internal successors, (282), 204 states have internal predecessors, (282), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-15 21:40:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 340 transitions. [2023-12-15 21:40:04,448 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 340 transitions. Word has length 135 [2023-12-15 21:40:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:40:04,449 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 340 transitions. [2023-12-15 21:40:04,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 340 transitions. [2023-12-15 21:40:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-15 21:40:04,450 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:04,450 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:40:04,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-15 21:40:04,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:40:04,657 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:04,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:04,657 INFO L85 PathProgramCache]: Analyzing trace with hash -863620871, now seen corresponding path program 1 times [2023-12-15 21:40:04,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:04,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842661694] [2023-12-15 21:40:04,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:04,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:04,679 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:40:04,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1790880038] [2023-12-15 21:40:04,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:04,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:40:04,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:40:04,680 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:40:04,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-15 21:40:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:04,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-15 21:40:04,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:40:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:40:04,862 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:40:04,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:40:04,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842661694] [2023-12-15 21:40:04,863 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:40:04,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790880038] [2023-12-15 21:40:04,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790880038] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:40:04,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:40:04,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:40:04,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055137035] [2023-12-15 21:40:04,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:40:04,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:40:04,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:40:04,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:40:04,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:40:04,864 INFO L87 Difference]: Start difference. First operand 235 states and 340 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:40:04,902 INFO L93 Difference]: Finished difference Result 522 states and 754 transitions. [2023-12-15 21:40:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:40:04,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2023-12-15 21:40:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:40:04,905 INFO L225 Difference]: With dead ends: 522 [2023-12-15 21:40:04,905 INFO L226 Difference]: Without dead ends: 288 [2023-12-15 21:40:04,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:40:04,906 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 65 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:40:04,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 641 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:40:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-12-15 21:40:04,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 240. [2023-12-15 21:40:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 208 states have (on average 1.3798076923076923) internal successors, (287), 209 states have internal predecessors, (287), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-15 21:40:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 345 transitions. [2023-12-15 21:40:04,914 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 345 transitions. Word has length 135 [2023-12-15 21:40:04,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:40:04,915 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 345 transitions. [2023-12-15 21:40:04,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 345 transitions. [2023-12-15 21:40:04,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-15 21:40:04,916 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:04,916 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:40:04,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-15 21:40:05,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:40:05,122 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:05,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:05,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2124237462, now seen corresponding path program 1 times [2023-12-15 21:40:05,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:05,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91842224] [2023-12-15 21:40:05,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:05,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:05,162 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:40:05,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [289841018] [2023-12-15 21:40:05,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:05,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:40:05,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:40:05,172 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:40:05,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-15 21:40:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:05,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-15 21:40:05,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:40:05,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:05,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2023-12-15 21:40:05,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:05,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2023-12-15 21:40:05,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:05,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2023-12-15 21:40:05,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:05,421 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 43 treesize of output 19 [2023-12-15 21:40:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:40:05,432 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:40:05,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:40:05,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91842224] [2023-12-15 21:40:05,432 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:40:05,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289841018] [2023-12-15 21:40:05,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289841018] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:40:05,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:40:05,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:40:05,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870977303] [2023-12-15 21:40:05,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:40:05,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:40:05,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:40:05,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:40:05,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:40:05,434 INFO L87 Difference]: Start difference. First operand 240 states and 345 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:40:05,745 INFO L93 Difference]: Finished difference Result 552 states and 786 transitions. [2023-12-15 21:40:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:40:05,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2023-12-15 21:40:05,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:40:05,747 INFO L225 Difference]: With dead ends: 552 [2023-12-15 21:40:05,747 INFO L226 Difference]: Without dead ends: 313 [2023-12-15 21:40:05,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:40:05,749 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 111 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:40:05,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 556 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:40:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2023-12-15 21:40:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 275. [2023-12-15 21:40:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 236 states have (on average 1.3559322033898304) internal successors, (320), 238 states have internal predecessors, (320), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:40:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 388 transitions. [2023-12-15 21:40:05,768 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 388 transitions. Word has length 135 [2023-12-15 21:40:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:40:05,768 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 388 transitions. [2023-12-15 21:40:05,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 388 transitions. [2023-12-15 21:40:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-15 21:40:05,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:05,769 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:40:05,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-15 21:40:05,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-15 21:40:05,976 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:05,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:05,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1882195708, now seen corresponding path program 1 times [2023-12-15 21:40:05,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:05,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376412189] [2023-12-15 21:40:05,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:05,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:06,008 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:40:06,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1540715466] [2023-12-15 21:40:06,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:06,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:40:06,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:40:06,009 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:40:06,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-15 21:40:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:06,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-15 21:40:06,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:40:06,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:06,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-12-15 21:40:06,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:06,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 47 [2023-12-15 21:40:06,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:06,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 47 [2023-12-15 21:40:06,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:06,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 22 [2023-12-15 21:40:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:40:06,335 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:40:06,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:40:06,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376412189] [2023-12-15 21:40:06,335 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:40:06,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540715466] [2023-12-15 21:40:06,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540715466] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:40:06,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:40:06,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:40:06,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74003] [2023-12-15 21:40:06,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:40:06,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:40:06,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:40:06,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:40:06,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:40:06,354 INFO L87 Difference]: Start difference. First operand 275 states and 388 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:40:06,721 INFO L93 Difference]: Finished difference Result 571 states and 803 transitions. [2023-12-15 21:40:06,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:40:06,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2023-12-15 21:40:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:40:06,723 INFO L225 Difference]: With dead ends: 571 [2023-12-15 21:40:06,723 INFO L226 Difference]: Without dead ends: 297 [2023-12-15 21:40:06,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:40:06,724 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 94 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:40:06,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 484 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:40:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-15 21:40:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 254. [2023-12-15 21:40:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 215 states have (on average 1.344186046511628) internal successors, (289), 217 states have internal predecessors, (289), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:40:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 357 transitions. [2023-12-15 21:40:06,736 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 357 transitions. Word has length 137 [2023-12-15 21:40:06,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:40:06,736 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 357 transitions. [2023-12-15 21:40:06,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:06,736 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 357 transitions. [2023-12-15 21:40:06,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-15 21:40:06,737 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:06,737 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:40:06,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-15 21:40:06,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:40:06,956 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:06,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:06,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1469930908, now seen corresponding path program 1 times [2023-12-15 21:40:06,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:06,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494711236] [2023-12-15 21:40:06,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:06,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:06,982 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:40:06,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316724938] [2023-12-15 21:40:06,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:06,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:40:06,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:40:06,998 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:40:07,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-15 21:40:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:07,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-15 21:40:07,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:40:07,255 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 21 treesize of output 21 [2023-12-15 21:40:07,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:07,283 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 37 treesize of output 24 [2023-12-15 21:40:07,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:40:07,289 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 37 treesize of output 24 [2023-12-15 21:40:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-15 21:40:07,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:40:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:40:07,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:40:07,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494711236] [2023-12-15 21:40:07,431 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:40:07,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316724938] [2023-12-15 21:40:07,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316724938] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 21:40:07,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:40:07,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 11 [2023-12-15 21:40:07,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991286850] [2023-12-15 21:40:07,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:40:07,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:40:07,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:40:07,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:40:07,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:40:07,433 INFO L87 Difference]: Start difference. First operand 254 states and 357 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:40:07,857 INFO L93 Difference]: Finished difference Result 673 states and 938 transitions. [2023-12-15 21:40:07,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:40:07,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2023-12-15 21:40:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:40:07,859 INFO L225 Difference]: With dead ends: 673 [2023-12-15 21:40:07,859 INFO L226 Difference]: Without dead ends: 430 [2023-12-15 21:40:07,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:40:07,860 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 169 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:40:07,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1008 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:40:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2023-12-15 21:40:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 406. [2023-12-15 21:40:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 343 states have (on average 1.3236151603498543) internal successors, (454), 347 states have internal predecessors, (454), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-15 21:40:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 562 transitions. [2023-12-15 21:40:07,879 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 562 transitions. Word has length 137 [2023-12-15 21:40:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:40:07,879 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 562 transitions. [2023-12-15 21:40:07,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 562 transitions. [2023-12-15 21:40:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-15 21:40:07,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:07,880 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:40:07,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-15 21:40:08,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-15 21:40:08,081 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:08,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:08,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2129986456, now seen corresponding path program 1 times [2023-12-15 21:40:08,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:08,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831421550] [2023-12-15 21:40:08,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:08,102 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:40:08,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [68207549] [2023-12-15 21:40:08,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:08,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:40:08,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:40:08,118 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:40:08,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-15 21:40:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:08,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 21:40:08,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:40:08,308 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 15 [2023-12-15 21:40:08,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-15 21:40:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:40:08,324 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:40:08,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:40:08,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831421550] [2023-12-15 21:40:08,324 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:40:08,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68207549] [2023-12-15 21:40:08,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68207549] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:40:08,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:40:08,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:40:08,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377042058] [2023-12-15 21:40:08,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:40:08,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:40:08,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:40:08,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:40:08,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:40:08,325 INFO L87 Difference]: Start difference. First operand 406 states and 562 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:08,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:40:08,508 INFO L93 Difference]: Finished difference Result 823 states and 1134 transitions. [2023-12-15 21:40:08,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:40:08,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2023-12-15 21:40:08,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:40:08,513 INFO L225 Difference]: With dead ends: 823 [2023-12-15 21:40:08,513 INFO L226 Difference]: Without dead ends: 428 [2023-12-15 21:40:08,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:40:08,515 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 58 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:40:08,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 395 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:40:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-12-15 21:40:08,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 392. [2023-12-15 21:40:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 329 states have (on average 1.3130699088145896) internal successors, (432), 333 states have internal predecessors, (432), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-15 21:40:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 540 transitions. [2023-12-15 21:40:08,550 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 540 transitions. Word has length 138 [2023-12-15 21:40:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:40:08,551 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 540 transitions. [2023-12-15 21:40:08,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:40:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 540 transitions. [2023-12-15 21:40:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-15 21:40:08,552 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:08,552 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:40:08,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-15 21:40:08,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-15 21:40:08,758 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:08,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:08,758 INFO L85 PathProgramCache]: Analyzing trace with hash -512538548, now seen corresponding path program 1 times [2023-12-15 21:40:08,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:08,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493360011] [2023-12-15 21:40:08,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:08,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:08,795 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:40:08,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [632618631] [2023-12-15 21:40:08,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:08,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:40:08,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:40:08,812 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:40:08,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-15 21:40:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:40:09,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:40:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:40:09,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:40:09,598 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:40:09,598 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:40:09,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-15 21:40:09,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-15 21:40:09,811 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:40:09,815 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:40:09,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:40:09 BoogieIcfgContainer [2023-12-15 21:40:09,888 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:40:09,889 INFO L158 Benchmark]: Toolchain (without parser) took 12065.00ms. Allocated memory was 217.1MB in the beginning and 410.0MB in the end (delta: 192.9MB). Free memory was 172.1MB in the beginning and 317.8MB in the end (delta: -145.7MB). Peak memory consumption was 48.5MB. Max. memory is 8.0GB. [2023-12-15 21:40:09,889 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 217.1MB. Free memory is still 165.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:40:09,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.98ms. Allocated memory is still 217.1MB. Free memory was 172.1MB in the beginning and 155.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-15 21:40:09,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.10ms. Allocated memory is still 217.1MB. Free memory was 155.2MB in the beginning and 149.9MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:40:09,889 INFO L158 Benchmark]: Boogie Preprocessor took 51.36ms. Allocated memory is still 217.1MB. Free memory was 149.9MB in the beginning and 144.6MB in the end (delta: 5.4MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:40:09,893 INFO L158 Benchmark]: RCFGBuilder took 684.13ms. Allocated memory was 217.1MB in the beginning and 332.4MB in the end (delta: 115.3MB). Free memory was 144.2MB in the beginning and 287.9MB in the end (delta: -143.7MB). Peak memory consumption was 34.9MB. Max. memory is 8.0GB. [2023-12-15 21:40:09,893 INFO L158 Benchmark]: TraceAbstraction took 11050.37ms. Allocated memory was 332.4MB in the beginning and 410.0MB in the end (delta: 77.6MB). Free memory was 286.9MB in the beginning and 317.8MB in the end (delta: -30.9MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. [2023-12-15 21:40:09,894 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.10ms. Allocated memory is still 217.1MB. Free memory is still 165.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.98ms. Allocated memory is still 217.1MB. Free memory was 172.1MB in the beginning and 155.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.10ms. Allocated memory is still 217.1MB. Free memory was 155.2MB in the beginning and 149.9MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.36ms. Allocated memory is still 217.1MB. Free memory was 149.9MB in the beginning and 144.6MB in the end (delta: 5.4MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 684.13ms. Allocated memory was 217.1MB in the beginning and 332.4MB in the end (delta: 115.3MB). Free memory was 144.2MB in the beginning and 287.9MB in the end (delta: -143.7MB). Peak memory consumption was 34.9MB. Max. memory is 8.0GB. * TraceAbstraction took 11050.37ms. Allocated memory was 332.4MB in the beginning and 410.0MB in the end (delta: 77.6MB). Free memory was 286.9MB in the beginning and 317.8MB in the end (delta: -30.9MB). Peak memory consumption was 47.2MB. 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 someBinaryFLOATComparisonOperation at line 121, overapproximation of shiftLeft at line 79, overapproximation of someUnaryFLOAToperation at line 121, overapproximation of someBinaryArithmeticFLOAToperation at line 85. Possible FailurePath: [L37] unsigned char isInitial = 0; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L53] signed long int last_1_WrapperStruct00_var_1_10 = 0; [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L118] EXPR WrapperStruct00.var_1_10 [L118] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L90] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L92] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L94] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -32768) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -32768) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L95] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L96] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L97] WrapperStruct00.var_1_6 = __VERIFIER_nondet_short() [L98] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -32768) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -32768) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L100] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L100] 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=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_6 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L101] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L102] 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=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L103] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L104] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L106] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L107] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L109] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L110] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L111] EXPR WrapperStruct00.var_1_13 [L111] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L111] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_13 [L111] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L111] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L111] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L112] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L113] EXPR WrapperStruct00.var_1_14 [L113] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L113] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_14 [L113] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L113] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L113] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L114] WrapperStruct00.var_1_15 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_15 [L115] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L115] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_15 [L115] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L115] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L115] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L129] RET updateVariables() [L130] CALL step() [L57] EXPR WrapperStruct00.var_1_5 [L57] EXPR WrapperStruct00.var_1_6 [L57] signed long int stepLocal_0 = (last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5) % WrapperStruct00.var_1_6; [L58] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L58] COND FALSE !(WrapperStruct00.var_1_2) [L63] EXPR WrapperStruct00.var_1_9 [L63] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_9 [L65] EXPR WrapperStruct00.var_1_1 [L65] unsigned char stepLocal_2 = WrapperStruct00.var_1_1; [L66] EXPR WrapperStruct00.var_1_1 [L66] EXPR WrapperStruct00.var_1_1 [L66] signed long int stepLocal_1 = WrapperStruct00.var_1_1 + WrapperStruct00.var_1_1; [L67] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L67] COND FALSE !(stepLocal_1 < WrapperStruct00.var_1_6) [L76] EXPR WrapperStruct00.var_1_9 [L76] WrapperStruct00.var_1_10 = WrapperStruct00.var_1_9 [L78] EXPR WrapperStruct00.var_1_1 [L78] unsigned char stepLocal_4 = WrapperStruct00.var_1_1; [L79] EXPR WrapperStruct00.var_1_9 [L79] EXPR WrapperStruct00.var_1_5 [L79] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L79] EXPR (WrapperStruct00.var_1_9 / WrapperStruct00.var_1_5) << WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0, stepLocal_0=0, stepLocal_1=508, stepLocal_2=254, stepLocal_4=254] [L79] signed long int stepLocal_3 = (WrapperStruct00.var_1_9 / WrapperStruct00.var_1_5) << WrapperStruct00.var_1_6; [L80] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L80] COND FALSE !(stepLocal_4 > WrapperStruct00.var_1_10) [L85] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L85] EXPR ((WrapperStruct00.var_1_13) < 0 ) ? -(WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_13) [L85] EXPR WrapperStruct00.var_1_13 [L85] EXPR ((WrapperStruct00.var_1_13) < 0 ) ? -(WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_13) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0, stepLocal_0=0, stepLocal_1=508, stepLocal_2=254, stepLocal_3=-253, stepLocal_4=254] [L85] EXPR WrapperStruct00.var_1_15 [L85] WrapperStruct00.var_1_11 = (((((WrapperStruct00.var_1_13) < 0 ) ? -(WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_13))) - WrapperStruct00.var_1_15) [L87] EXPR WrapperStruct00.var_1_15 [L87] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_15 [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L121] EXPR WrapperStruct00.var_1_2 ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5) % WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) > (WrapperStruct00.var_1_9)) ? (((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_9))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_9)) [L121] EXPR WrapperStruct00.var_1_1 [L121] EXPR WrapperStruct00.var_1_9 [L121] EXPR WrapperStruct00.var_1_2 ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5) % WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) > (WrapperStruct00.var_1_9)) ? (((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_9))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_9)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L121] EXPR (WrapperStruct00.var_1_2 ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5) % WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) > (WrapperStruct00.var_1_9)) ? (((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_9))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_9))) && (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_1) < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_9))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L121] EXPR (WrapperStruct00.var_1_2 ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5) % WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) > (WrapperStruct00.var_1_9)) ? (((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_9))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_9))) && (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_1) < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_9))) [L121] EXPR WrapperStruct00.var_1_1 [L121] EXPR WrapperStruct00.var_1_1 [L121] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L121] EXPR ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_1) < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_9)) [L121] EXPR WrapperStruct00.var_1_10 [L121] EXPR WrapperStruct00.var_1_9 [L121] EXPR ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_1) < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_9)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L121] EXPR (WrapperStruct00.var_1_2 ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5) % WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) > (WrapperStruct00.var_1_9)) ? (((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_9))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_9))) && (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_1) < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_9))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L121] EXPR ((WrapperStruct00.var_1_2 ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5) % WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) > (WrapperStruct00.var_1_9)) ? (((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_9))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_9))) && (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_1) < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_9)))) && ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 <= ((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_5) << WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_11 == ((float) (((((WrapperStruct00.var_1_13) < 0 ) ? -(WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_13))) - WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L121] EXPR ((WrapperStruct00.var_1_2 ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5) % WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) > (WrapperStruct00.var_1_9)) ? (((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_9))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_9))) && (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_1) < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_9)))) && ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 <= ((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_5) << WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_11 == ((float) (((((WrapperStruct00.var_1_13) < 0 ) ? -(WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_13))) - WrapperStruct00.var_1_15)))) [L121] EXPR WrapperStruct00.var_1_1 [L121] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L121] EXPR (WrapperStruct00.var_1_1 > WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 <= ((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_5) << WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_11 == ((float) (((((WrapperStruct00.var_1_13) < 0 ) ? -(WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_13))) - WrapperStruct00.var_1_15))) [L121] EXPR WrapperStruct00.var_1_11 [L121] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L121] EXPR ((WrapperStruct00.var_1_13) < 0 ) ? -(WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_13) [L121] EXPR WrapperStruct00.var_1_13 [L121] EXPR ((WrapperStruct00.var_1_13) < 0 ) ? -(WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_13) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L121] EXPR WrapperStruct00.var_1_15 [L121] EXPR (WrapperStruct00.var_1_1 > WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 <= ((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_5) << WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_11 == ((float) (((((WrapperStruct00.var_1_13) < 0 ) ? -(WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_13))) - WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L121] EXPR ((WrapperStruct00.var_1_2 ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5) % WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) > (WrapperStruct00.var_1_9)) ? (((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_9))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_9))) && (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_1) < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_9)))) && ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 <= ((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_5) << WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_11 == ((float) (((((WrapperStruct00.var_1_13) < 0 ) ? -(WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_13))) - WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L121] EXPR (((WrapperStruct00.var_1_2 ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5) % WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) > (WrapperStruct00.var_1_9)) ? (((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_9))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_9))) && (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_1) < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_9)))) && ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 <= ((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_5) << WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_11 == ((float) (((((WrapperStruct00.var_1_13) < 0 ) ? -(WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_13))) - WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_15)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L121] EXPR (((WrapperStruct00.var_1_2 ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5) % WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) > (WrapperStruct00.var_1_9)) ? (((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_9))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_9))) && (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_1) < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_9)))) && ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 <= ((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_5) << WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_11 == ((float) (((((WrapperStruct00.var_1_13) < 0 ) ? -(WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_13))) - WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_15)) [L121] EXPR WrapperStruct00.var_1_16 [L121] EXPR WrapperStruct00.var_1_15 [L121] EXPR (((WrapperStruct00.var_1_2 ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5) % WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) > (WrapperStruct00.var_1_9)) ? (((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_9))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_9))) && (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_1) < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_9)))) && ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 <= ((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_5) << WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_11 == ((float) (((((WrapperStruct00.var_1_13) < 0 ) ? -(WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_13))) - WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_15)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L121-L122] return (((WrapperStruct00.var_1_2 ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5) % WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) > (WrapperStruct00.var_1_9)) ? (((((WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_9))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_9))) && (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_1) < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_9)))) && ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 <= ((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_5) << WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_11 == ((float) (((((WrapperStruct00.var_1_13) < 0 ) ? -(WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_13))) - WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_15)) ; [L131] RET, EXPR property() [L131] 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=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_10=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 12, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1574 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1574 mSDsluCounter, 5945 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4164 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2740 IncrementalHoareTripleChecker+Invalid, 2891 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 1781 mSDtfsCounter, 2740 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1897 GetRequests, 1815 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=406occurred in iteration=10, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 667 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1750 NumberOfCodeBlocks, 1750 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1870 ConstructedInterpolants, 0 QuantifiedInterpolants, 4373 SizeOfPredicates, 63 NumberOfNonLiveVariables, 4856 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 7472/7616 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-15 21:40:09,931 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...