/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 20:23:44,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 20:23:44,727 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-20 20:23:44,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 20:23:44,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 20:23:44,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 20:23:44,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 20:23:44,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 20:23:44,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 20:23:44,749 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 20:23:44,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 20:23:44,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 20:23:44,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 20:23:44,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 20:23:44,751 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 20:23:44,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 20:23:44,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 20:23:44,752 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 20:23:44,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 20:23:44,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 20:23:44,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 20:23:44,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 20:23:44,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 20:23:44,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 20:23:44,754 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 20:23:44,755 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 20:23:44,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 20:23:44,755 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 20:23:44,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 20:23:44,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 20:23:44,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 20:23:44,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 20:23:44,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 20:23:44,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 20:23:44,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 20:23:44,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 20:23:44,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 20:23:44,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 20:23:44,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 20:23:44,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 20:23:44,759 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 20:23:44,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 20:23:44,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 20:23:44,760 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 20:23:44,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 20:23:44,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 20:23:44,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 20:23:44,955 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 20:23:44,956 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 20:23:44,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-10.i [2023-12-20 20:23:46,094 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 20:23:46,276 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 20:23:46,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-10.i [2023-12-20 20:23:46,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c28153723/8492ba33abb144c2aa474ef310073655/FLAG3a038b8c5 [2023-12-20 20:23:46,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c28153723/8492ba33abb144c2aa474ef310073655 [2023-12-20 20:23:46,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 20:23:46,301 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 20:23:46,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 20:23:46,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 20:23:46,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 20:23:46,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 08:23:46" (1/1) ... [2023-12-20 20:23:46,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d29b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:23:46, skipping insertion in model container [2023-12-20 20:23:46,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 08:23:46" (1/1) ... [2023-12-20 20:23:46,352 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 20:23:46,484 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_fillercode_fillercodesize_ps-cn-50_file-10.i[915,928] [2023-12-20 20:23:46,563 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 20:23:46,575 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 20:23:46,585 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_fillercode_fillercodesize_ps-cn-50_file-10.i[915,928] [2023-12-20 20:23:46,629 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 20:23:46,650 INFO L206 MainTranslator]: Completed translation [2023-12-20 20:23:46,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:23:46 WrapperNode [2023-12-20 20:23:46,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 20:23:46,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 20:23:46,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 20:23:46,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 20:23:46,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:23:46" (1/1) ... [2023-12-20 20:23:46,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:23:46" (1/1) ... [2023-12-20 20:23:46,716 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 297 [2023-12-20 20:23:46,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 20:23:46,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 20:23:46,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 20:23:46,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 20:23:46,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:23:46" (1/1) ... [2023-12-20 20:23:46,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:23:46" (1/1) ... [2023-12-20 20:23:46,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:23:46" (1/1) ... [2023-12-20 20:23:46,758 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 20:23:46,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:23:46" (1/1) ... [2023-12-20 20:23:46,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:23:46" (1/1) ... [2023-12-20 20:23:46,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:23:46" (1/1) ... [2023-12-20 20:23:46,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:23:46" (1/1) ... [2023-12-20 20:23:46,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:23:46" (1/1) ... [2023-12-20 20:23:46,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:23:46" (1/1) ... [2023-12-20 20:23:46,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 20:23:46,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 20:23:46,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 20:23:46,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 20:23:46,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:23:46" (1/1) ... [2023-12-20 20:23:46,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 20:23:46,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:23:46,837 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-20 20:23:46,857 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-20 20:23:46,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 20:23:46,885 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 20:23:46,885 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 20:23:46,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 20:23:46,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 20:23:46,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 20:23:47,017 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 20:23:47,021 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 20:23:47,430 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 20:23:47,456 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 20:23:47,456 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 20:23:47,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 08:23:47 BoogieIcfgContainer [2023-12-20 20:23:47,457 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 20:23:47,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 20:23:47,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 20:23:47,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 20:23:47,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 08:23:46" (1/3) ... [2023-12-20 20:23:47,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b491e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 08:23:47, skipping insertion in model container [2023-12-20 20:23:47,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:23:46" (2/3) ... [2023-12-20 20:23:47,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b491e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 08:23:47, skipping insertion in model container [2023-12-20 20:23:47,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 08:23:47" (3/3) ... [2023-12-20 20:23:47,463 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-10.i [2023-12-20 20:23:47,478 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 20:23:47,478 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 20:23:47,536 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 20:23:47,543 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;@237c183b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 20:23:47,544 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 20:23:47,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 68 states have (on average 1.411764705882353) internal successors, (96), 69 states have internal predecessors, (96), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-20 20:23:47,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2023-12-20 20:23:47,583 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:23:47,584 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:23:47,586 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:23:47,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:23:47,593 INFO L85 PathProgramCache]: Analyzing trace with hash 58737502, now seen corresponding path program 1 times [2023-12-20 20:23:47,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:23:47,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187194560] [2023-12-20 20:23:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:23:47,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:23:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:23:47,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:23:47,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187194560] [2023-12-20 20:23:47,873 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-20 20:23:47,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554728920] [2023-12-20 20:23:47,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:23:47,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:23:47,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:23:47,877 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-20 20:23:47,886 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-20 20:23:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:23:48,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-20 20:23:48,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:23:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2023-12-20 20:23:48,212 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 20:23:48,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554728920] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 20:23:48,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 20:23:48,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 20:23:48,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035515865] [2023-12-20 20:23:48,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:23:48,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 20:23:48,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:23:48,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 20:23:48,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 20:23:48,253 INFO L87 Difference]: Start difference. First operand has 119 states, 68 states have (on average 1.411764705882353) internal successors, (96), 69 states have internal predecessors, (96), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2023-12-20 20:23:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:23:48,301 INFO L93 Difference]: Finished difference Result 235 states and 430 transitions. [2023-12-20 20:23:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 20:23:48,304 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 292 [2023-12-20 20:23:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:23:48,314 INFO L225 Difference]: With dead ends: 235 [2023-12-20 20:23:48,314 INFO L226 Difference]: Without dead ends: 117 [2023-12-20 20:23:48,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 291 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-20 20:23:48,329 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 20:23:48,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 20:23:48,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-20 20:23:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-12-20 20:23:48,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-20 20:23:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 187 transitions. [2023-12-20 20:23:48,384 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 187 transitions. Word has length 292 [2023-12-20 20:23:48,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:23:48,385 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 187 transitions. [2023-12-20 20:23:48,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2023-12-20 20:23:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 187 transitions. [2023-12-20 20:23:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2023-12-20 20:23:48,393 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:23:48,394 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:23:48,401 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-20 20:23:48,594 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-20 20:23:48,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:23:48,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:23:48,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1479591270, now seen corresponding path program 1 times [2023-12-20 20:23:48,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:23:48,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593537371] [2023-12-20 20:23:48,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:23:48,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:23:48,726 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:23:48,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1858730953] [2023-12-20 20:23:48,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:23:48,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:23:48,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:23:48,732 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-20 20:23:48,751 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-20 20:23:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:23:48,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 20:23:48,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:23:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2023-12-20 20:23:49,263 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 20:23:49,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:23:49,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593537371] [2023-12-20 20:23:49,264 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:23:49,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858730953] [2023-12-20 20:23:49,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858730953] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 20:23:49,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 20:23:49,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 20:23:49,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574011292] [2023-12-20 20:23:49,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:23:49,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 20:23:49,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:23:49,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 20:23:49,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 20:23:49,271 INFO L87 Difference]: Start difference. First operand 117 states and 187 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-12-20 20:23:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:23:49,515 INFO L93 Difference]: Finished difference Result 350 states and 560 transitions. [2023-12-20 20:23:49,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 20:23:49,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 292 [2023-12-20 20:23:49,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:23:49,526 INFO L225 Difference]: With dead ends: 350 [2023-12-20 20:23:49,527 INFO L226 Difference]: Without dead ends: 234 [2023-12-20 20:23:49,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 289 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-20 20:23:49,529 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 109 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 20:23:49,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 539 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 20:23:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-12-20 20:23:49,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 210. [2023-12-20 20:23:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 111 states have internal predecessors, (146), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-20 20:23:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 338 transitions. [2023-12-20 20:23:49,605 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 338 transitions. Word has length 292 [2023-12-20 20:23:49,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:23:49,608 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 338 transitions. [2023-12-20 20:23:49,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-12-20 20:23:49,609 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 338 transitions. [2023-12-20 20:23:49,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-12-20 20:23:49,617 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:23:49,617 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:23:49,626 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-20 20:23:49,825 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-20 20:23:49,826 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:23:49,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:23:49,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1535919220, now seen corresponding path program 1 times [2023-12-20 20:23:49,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:23:49,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270628144] [2023-12-20 20:23:49,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:23:49,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:23:49,872 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:23:49,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [726505594] [2023-12-20 20:23:49,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:23:49,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:23:49,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:23:49,875 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-20 20:23:49,894 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-20 20:23:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:23:50,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-20 20:23:50,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:23:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 2131 proven. 303 refuted. 0 times theorem prover too weak. 2078 trivial. 0 not checked. [2023-12-20 20:23:51,478 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 20:23:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 102 proven. 312 refuted. 0 times theorem prover too weak. 4098 trivial. 0 not checked. [2023-12-20 20:23:52,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:23:52,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270628144] [2023-12-20 20:23:52,466 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:23:52,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726505594] [2023-12-20 20:23:52,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726505594] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 20:23:52,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 20:23:52,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2023-12-20 20:23:52,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422772705] [2023-12-20 20:23:52,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 20:23:52,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-20 20:23:52,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:23:52,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-20 20:23:52,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2023-12-20 20:23:52,472 INFO L87 Difference]: Start difference. First operand 210 states and 338 transitions. Second operand has 32 states, 31 states have (on average 3.903225806451613) internal successors, (121), 30 states have internal predecessors, (121), 7 states have call successors, (85), 4 states have call predecessors, (85), 9 states have return successors, (86), 7 states have call predecessors, (86), 7 states have call successors, (86) [2023-12-20 20:23:54,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:23:54,862 INFO L93 Difference]: Finished difference Result 467 states and 685 transitions. [2023-12-20 20:23:54,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-20 20:23:54,863 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.903225806451613) internal successors, (121), 30 states have internal predecessors, (121), 7 states have call successors, (85), 4 states have call predecessors, (85), 9 states have return successors, (86), 7 states have call predecessors, (86), 7 states have call successors, (86) Word has length 293 [2023-12-20 20:23:54,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:23:54,865 INFO L225 Difference]: With dead ends: 467 [2023-12-20 20:23:54,865 INFO L226 Difference]: Without dead ends: 351 [2023-12-20 20:23:54,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1343, Invalid=4059, Unknown=0, NotChecked=0, Total=5402 [2023-12-20 20:23:54,869 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 696 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-20 20:23:54,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 919 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-20 20:23:54,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-12-20 20:23:54,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 296. [2023-12-20 20:23:54,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 180 states have (on average 1.2777777777777777) internal successors, (230), 182 states have internal predecessors, (230), 102 states have call successors, (102), 13 states have call predecessors, (102), 13 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) [2023-12-20 20:23:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 434 transitions. [2023-12-20 20:23:54,908 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 434 transitions. Word has length 293 [2023-12-20 20:23:54,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:23:54,909 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 434 transitions. [2023-12-20 20:23:54,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.903225806451613) internal successors, (121), 30 states have internal predecessors, (121), 7 states have call successors, (85), 4 states have call predecessors, (85), 9 states have return successors, (86), 7 states have call predecessors, (86), 7 states have call successors, (86) [2023-12-20 20:23:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 434 transitions. [2023-12-20 20:23:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-12-20 20:23:54,912 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:23:54,913 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:23:54,926 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-20 20:23:55,120 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-20 20:23:55,121 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:23:55,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:23:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1018766196, now seen corresponding path program 1 times [2023-12-20 20:23:55,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:23:55,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488235195] [2023-12-20 20:23:55,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:23:55,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:23:55,167 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:23:55,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [957270795] [2023-12-20 20:23:55,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:23:55,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:23:55,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:23:55,182 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-20 20:23:55,201 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-20 20:23:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:23:55,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-20 20:23:55,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:24:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1904 proven. 228 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2023-12-20 20:24:00,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 20:25:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2023-12-20 20:25:29,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:25:29,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488235195] [2023-12-20 20:25:29,249 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:25:29,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957270795] [2023-12-20 20:25:29,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957270795] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-20 20:25:29,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 20:25:29,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 29 [2023-12-20 20:25:29,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534344018] [2023-12-20 20:25:29,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:25:29,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 20:25:29,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:25:29,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 20:25:29,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=615, Unknown=7, NotChecked=0, Total=812 [2023-12-20 20:25:29,251 INFO L87 Difference]: Start difference. First operand 296 states and 434 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-12-20 20:25:52,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:25:56,479 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (mod c_~var_1_5~0 65536)) (.cse16 (mod c_~var_1_4~0 65536))) (let ((.cse26 (< 56892 .cse16)) (.cse77 (* 65535 c_~var_1_5~0)) (.cse78 (* 65535 c_~var_1_7~0)) (.cse22 (mod c_~var_1_1~0 65536)) (.cse19 (mod c_~var_1_7~0 65536)) (.cse53 (+ .cse15 1)) (.cse7 (= (mod c_~last_1_var_1_8~0 256) 0))) (let ((.cse5 (not .cse7)) (.cse0 (< .cse19 .cse53)) (.cse1 (< 65534 .cse19)) (.cse3 (< .cse15 .cse19)) (.cse4 (< 65534 .cse15)) (.cse2 (= .cse22 .cse15)) (.cse18 (= 1 (mod c_~var_1_8~0 256))) (.cse17 (or .cse26 (= .cse22 (mod (+ .cse77 c_~var_1_4~0 .cse78) 65536)))) (.cse28 (+ .cse19 1)) (.cse36 (mod (+ .cse77 56892) 65536)) (.cse31 (+ .cse22 65536)) (.cse24 (= .cse22 (mod (+ .cse77 .cse78 56892) 65536))) (.cse23 (mod (+ .cse77 c_~var_1_4~0) 65536)) (.cse25 (< .cse16 56893)) (.cse50 (mod c_~var_1_14~0 65536))) (let ((.cse6 (< c_~var_1_13~0 0)) (.cse51 (let ((.cse52 (mod c_~var_1_11~0 4294967296)) (.cse55 (mod c_~var_1_16~0 65536)) (.cse54 (+ .cse15 c_~var_1_11~0))) (and (or .cse5 (and (or .cse0 .cse1 .cse2 (< .cse52 .cse28)) (or .cse3 (< .cse52 .cse53) .cse4 .cse2))) (or (= .cse23 .cse50) (< .cse54 (+ .cse55 1))) .cse18 (or .cse7 (and (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse56 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 .cse56) (< .cse52 .cse56) (< .cse56 .cse28) (< 65535 v_z_98) (< (+ v_z_98 .cse23) 65536)))) .cse26) .cse17 (or .cse26 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse57 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< v_z_98 0) (< 65535 .cse57) (< .cse52 .cse57) (< .cse57 .cse28) (< 65535 v_z_98))))) (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse58 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 (+ v_z_98 .cse23)) (< v_z_98 0) (< 65535 .cse58) (< .cse52 .cse58) (< .cse58 .cse28)))) .cse26) (or .cse25 (and (forall ((v_z_99 Int)) (let ((.cse59 (+ v_z_99 .cse36))) (or (= .cse22 .cse59) (< 65535 .cse59) (forall ((v_y_99 Int)) (let ((.cse60 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse52 .cse60) (< .cse60 .cse28) (< 65535 .cse60)))) (< v_z_99 0)))) (or (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse61 (+ v_z_99 .cse36)) (.cse62 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse61) (< 65535 .cse61) (< .cse52 .cse62) (< v_z_99 0) (< .cse62 0) (< 65535 .cse62)))) .cse24) (forall ((v_z_99 Int)) (let ((.cse63 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse63 .cse31) (forall ((v_y_99 Int)) (let ((.cse64 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse52 .cse64) (< .cse64 .cse28) (< 65535 .cse64)))) (< .cse63 65536)))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse65 (+ v_z_99 .cse36)) (.cse66 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse65) (< 65535 v_z_99) (= .cse65 .cse31) (< .cse52 .cse66) (< v_z_99 0) (< .cse66 0) (< 65535 .cse66))))) (forall ((v_z_99 Int)) (let ((.cse67 (+ v_z_99 .cse36))) (or (= .cse22 .cse67) (< 65535 v_z_99) (= .cse67 .cse31) (forall ((v_y_99 Int)) (let ((.cse68 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse52 .cse68) (< .cse68 .cse28) (< 65535 .cse68)))) (< v_z_99 0)))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse70 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse69 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse69 .cse31) (< .cse52 .cse70) (< .cse70 0) (< 65535 .cse70) (< .cse69 65536))))))) (or .cse24 .cse25 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse71 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse72 (+ v_z_98 .cse23))) (or (< .cse19 .cse71) (< .cse71 0) (< .cse52 .cse71) (< 65535 v_z_98) (< .cse72 65536) (= .cse72 .cse31))))) (or .cse24 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse73 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse74 (+ v_z_98 .cse23))) (or (< .cse19 .cse73) (< v_z_98 0) (< .cse73 0) (< .cse52 .cse73) (< 65535 v_z_98) (= .cse22 .cse74) (= .cse74 .cse31)))) .cse25) (or .cse24 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse75 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse76 (+ v_z_98 .cse23))) (or (< .cse19 .cse75) (< 65535 .cse76) (< v_z_98 0) (< .cse75 0) (< .cse52 .cse75) (= .cse22 .cse76)))) .cse25))) (or (< .cse55 .cse54) (= .cse50 (mod (+ c_~var_1_4~0 (* c_~var_1_16~0 65535) c_~var_1_11~0) 65536)))))) (.cse49 (= (mod c_~var_1_9~0 256) 0))) (and (or (let ((.cse8 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse47 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse48 (+ v_z_98 .cse23))) (or (< .cse19 .cse47) (< .cse47 0) (< 65535 v_z_98) (< .cse48 65536) (= .cse48 .cse31)))) .cse24 .cse25)) (.cse9 (or .cse25 (and (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse34 (+ v_z_99 .cse36)) (.cse35 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse34) (< 65535 v_z_99) (= .cse34 .cse31) (< v_z_99 0) (< .cse35 .cse28) (< 65535 .cse35)))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse38 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse37 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse37 .cse31) (< .cse38 0) (< 65535 .cse38) (< .cse37 65536))))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse39 (+ v_z_99 .cse36)) (.cse40 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse39) (< 65535 .cse39) (< v_z_99 0) (< .cse40 0) (< 65535 .cse40))))) (or (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse41 (+ v_z_99 .cse36)) (.cse42 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse41) (< 65535 v_z_99) (= .cse41 .cse31) (< v_z_99 0) (< .cse42 0) (< 65535 .cse42)))) .cse24) (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse43 (+ v_z_99 .cse36)) (.cse44 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse43) (< 65535 .cse43) (< v_z_99 0) (< .cse44 .cse28) (< 65535 .cse44)))) (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse46 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse45 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse45 .cse31) (< .cse46 .cse28) (< 65535 .cse46) (< .cse45 65536))))))) (.cse10 (or .cse26 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse33 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 (+ v_z_98 .cse23)) (< v_z_98 0) (< 65535 .cse33) (< .cse33 .cse28)))))) (.cse11 (or .cse26 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse32 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< v_z_98 0) (< 65535 .cse32) (< .cse32 .cse28) (< 65535 v_z_98)))))) (.cse12 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse29 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse30 (+ v_z_98 .cse23))) (or (< .cse19 .cse29) (< v_z_98 0) (< .cse29 0) (< 65535 v_z_98) (= .cse22 .cse30) (= .cse30 .cse31)))) .cse24 .cse25)) (.cse13 (or .cse26 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse27 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 .cse27) (< .cse27 .cse28) (< 65535 v_z_98) (< (+ v_z_98 .cse23) 65536)))))) (.cse14 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse20 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse21 (+ v_z_98 .cse23))) (or (< .cse19 .cse20) (< 65535 .cse21) (< v_z_98 0) (< .cse20 0) (= .cse22 .cse21)))) .cse24 .cse25))) (and (or (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse2)) .cse5 .cse6) (or .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (< (+ (* 65536 (div (+ (* (- 1) .cse15) .cse16) 65536)) c_~var_1_13~0 .cse15) .cse16)) (or .cse7 .cse6 (and .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (or .cse18 .cse6))) .cse49) (or .cse4 .cse6 .cse2) (or (< c_~var_1_13~0 .cse50) .cse51 .cse49) (or .cse7 .cse6) (or (< |c_ULTIMATE.start_step_~stepLocal_4~0#1| .cse50) .cse51 .cse49)))))) is different from false [2023-12-20 20:26:01,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:26:03,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:26:07,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:26:11,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:26:16,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:26:20,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:26:24,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:26:25,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:26:57,171 WARN L293 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 261 DAG size of output: 259 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 20:27:01,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:27:05,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:27:10,128 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (mod c_~var_1_5~0 65536)) (.cse101 (* 65535 c_~var_1_5~0)) (.cse19 (mod c_~var_1_4~0 65536))) (let ((.cse29 (< 56892 .cse19)) (.cse102 (* 65535 c_~var_1_7~0)) (.cse26 (mod (+ .cse101 c_~var_1_4~0) 65536)) (.cse1 (mod c_~var_1_14~0 65536)) (.cse100 (+ .cse18 c_~var_1_11~0)) (.cse99 (mod c_~var_1_16~0 65536)) (.cse25 (mod c_~var_1_1~0 65536)) (.cse22 (mod c_~var_1_7~0 65536)) (.cse74 (+ .cse18 1)) (.cse10 (= (mod c_~last_1_var_1_8~0 256) 0))) (let ((.cse8 (not .cse10)) (.cse3 (< .cse22 .cse74)) (.cse4 (< 65534 .cse22)) (.cse6 (< .cse18 .cse22)) (.cse7 (< 65534 .cse18)) (.cse5 (= .cse25 .cse18)) (.cse75 (or (= .cse26 .cse1) (< .cse100 (+ .cse99 1)))) (.cse21 (= 1 (mod c_~var_1_8~0 256))) (.cse20 (or .cse29 (= .cse25 (mod (+ .cse101 c_~var_1_4~0 .cse102) 65536)))) (.cse31 (+ .cse22 1)) (.cse39 (mod (+ .cse101 56892) 65536)) (.cse34 (+ .cse25 65536)) (.cse27 (= .cse25 (mod (+ .cse101 .cse102 56892) 65536))) (.cse28 (< .cse19 56893)) (.cse76 (or (< .cse99 .cse100) (= .cse1 (mod (+ c_~var_1_4~0 (* c_~var_1_16~0 65535) c_~var_1_11~0) 65536))))) (let ((.cse9 (< c_~var_1_13~0 0)) (.cse0 (let ((.cse77 (mod c_~var_1_11~0 4294967296))) (and (or .cse8 (and (or .cse3 .cse4 .cse5 (< .cse77 .cse31)) (or .cse6 (< .cse77 .cse74) .cse7 .cse5))) .cse75 .cse21 (or .cse10 (and (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse78 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 .cse78) (< .cse77 .cse78) (< .cse78 .cse31) (< 65535 v_z_98) (< (+ v_z_98 .cse26) 65536)))) .cse29) .cse20 (or .cse29 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse79 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< v_z_98 0) (< 65535 .cse79) (< .cse77 .cse79) (< .cse79 .cse31) (< 65535 v_z_98))))) (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse80 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 (+ v_z_98 .cse26)) (< v_z_98 0) (< 65535 .cse80) (< .cse77 .cse80) (< .cse80 .cse31)))) .cse29) (or .cse28 (and (forall ((v_z_99 Int)) (let ((.cse81 (+ v_z_99 .cse39))) (or (= .cse25 .cse81) (< 65535 .cse81) (forall ((v_y_99 Int)) (let ((.cse82 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse77 .cse82) (< .cse82 .cse31) (< 65535 .cse82)))) (< v_z_99 0)))) (or (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse83 (+ v_z_99 .cse39)) (.cse84 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse25 .cse83) (< 65535 .cse83) (< .cse77 .cse84) (< v_z_99 0) (< .cse84 0) (< 65535 .cse84)))) .cse27) (forall ((v_z_99 Int)) (let ((.cse85 (+ v_z_99 .cse39))) (or (< 65535 v_z_99) (= .cse85 .cse34) (forall ((v_y_99 Int)) (let ((.cse86 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse77 .cse86) (< .cse86 .cse31) (< 65535 .cse86)))) (< .cse85 65536)))) (or .cse27 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse87 (+ v_z_99 .cse39)) (.cse88 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse25 .cse87) (< 65535 v_z_99) (= .cse87 .cse34) (< .cse77 .cse88) (< v_z_99 0) (< .cse88 0) (< 65535 .cse88))))) (forall ((v_z_99 Int)) (let ((.cse89 (+ v_z_99 .cse39))) (or (= .cse25 .cse89) (< 65535 v_z_99) (= .cse89 .cse34) (forall ((v_y_99 Int)) (let ((.cse90 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse77 .cse90) (< .cse90 .cse31) (< 65535 .cse90)))) (< v_z_99 0)))) (or .cse27 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse92 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse91 (+ v_z_99 .cse39))) (or (< 65535 v_z_99) (= .cse91 .cse34) (< .cse77 .cse92) (< .cse92 0) (< 65535 .cse92) (< .cse91 65536))))))) (or .cse27 .cse28 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse93 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse94 (+ v_z_98 .cse26))) (or (< .cse22 .cse93) (< .cse93 0) (< .cse77 .cse93) (< 65535 v_z_98) (< .cse94 65536) (= .cse94 .cse34))))) (or .cse27 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse95 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse96 (+ v_z_98 .cse26))) (or (< .cse22 .cse95) (< v_z_98 0) (< .cse95 0) (< .cse77 .cse95) (< 65535 v_z_98) (= .cse25 .cse96) (= .cse96 .cse34)))) .cse28) (or .cse27 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse97 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse98 (+ v_z_98 .cse26))) (or (< .cse22 .cse97) (< 65535 .cse98) (< v_z_98 0) (< .cse97 0) (< .cse77 .cse97) (= .cse25 .cse98)))) .cse28))) .cse76))) (.cse2 (= (mod c_~var_1_9~0 256) 0))) (and (or .cse0 (< |c_ULTIMATE.start_step_#t~ite11#1| .cse1) .cse2) (or (let ((.cse11 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse50 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse51 (+ v_z_98 .cse26))) (or (< .cse22 .cse50) (< .cse50 0) (< 65535 v_z_98) (< .cse51 65536) (= .cse51 .cse34)))) .cse27 .cse28)) (.cse12 (or .cse28 (and (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse37 (+ v_z_99 .cse39)) (.cse38 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse25 .cse37) (< 65535 v_z_99) (= .cse37 .cse34) (< v_z_99 0) (< .cse38 .cse31) (< 65535 .cse38)))) (or .cse27 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse41 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse40 (+ v_z_99 .cse39))) (or (< 65535 v_z_99) (= .cse40 .cse34) (< .cse41 0) (< 65535 .cse41) (< .cse40 65536))))) (or .cse27 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse42 (+ v_z_99 .cse39)) (.cse43 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse25 .cse42) (< 65535 .cse42) (< v_z_99 0) (< .cse43 0) (< 65535 .cse43))))) (or (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse44 (+ v_z_99 .cse39)) (.cse45 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse25 .cse44) (< 65535 v_z_99) (= .cse44 .cse34) (< v_z_99 0) (< .cse45 0) (< 65535 .cse45)))) .cse27) (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse46 (+ v_z_99 .cse39)) (.cse47 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse25 .cse46) (< 65535 .cse46) (< v_z_99 0) (< .cse47 .cse31) (< 65535 .cse47)))) (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse49 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse48 (+ v_z_99 .cse39))) (or (< 65535 v_z_99) (= .cse48 .cse34) (< .cse49 .cse31) (< 65535 .cse49) (< .cse48 65536))))))) (.cse13 (or .cse29 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse36 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 (+ v_z_98 .cse26)) (< v_z_98 0) (< 65535 .cse36) (< .cse36 .cse31)))))) (.cse14 (or .cse29 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse35 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< v_z_98 0) (< 65535 .cse35) (< .cse35 .cse31) (< 65535 v_z_98)))))) (.cse15 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse32 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse33 (+ v_z_98 .cse26))) (or (< .cse22 .cse32) (< v_z_98 0) (< .cse32 0) (< 65535 v_z_98) (= .cse25 .cse33) (= .cse33 .cse34)))) .cse27 .cse28)) (.cse16 (or .cse29 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse30 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 .cse30) (< .cse30 .cse31) (< 65535 v_z_98) (< (+ v_z_98 .cse26) 65536)))))) (.cse17 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse23 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse24 (+ v_z_98 .cse26))) (or (< .cse22 .cse23) (< 65535 .cse24) (< v_z_98 0) (< .cse23 0) (= .cse25 .cse24)))) .cse27 .cse28))) (and (or (and (or .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse5)) .cse8 .cse9) (or .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (< (+ (* 65536 (div (+ (* (- 1) .cse18) .cse19) 65536)) c_~var_1_13~0 .cse18) .cse19)) (or .cse10 .cse9 (and .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (or .cse21 .cse9))) .cse2) (or .cse7 .cse9 .cse5) (or (let ((.cse54 (mod c_~var_1_17~0 4294967296))) (and (or .cse10 (and (or .cse27 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse52 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse53 (+ v_z_98 .cse26))) (or (< .cse22 .cse52) (< v_z_98 0) (< .cse52 0) (< 65535 v_z_98) (= .cse25 .cse53) (< .cse54 .cse52) (= .cse53 .cse34)))) .cse28) (or .cse27 .cse28 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse55 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse56 (+ v_z_98 .cse26))) (or (< .cse22 .cse55) (< .cse55 0) (< 65535 v_z_98) (< .cse56 65536) (< .cse54 .cse55) (= .cse56 .cse34))))) (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse57 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 (+ v_z_98 .cse26)) (< v_z_98 0) (< 65535 .cse57) (< .cse57 .cse31) (< .cse54 .cse57)))) .cse29) .cse20 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse58 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 .cse58) (< .cse58 .cse31) (< 65535 v_z_98) (< (+ v_z_98 .cse26) 65536) (< .cse54 .cse58)))) .cse29) (or (and (or .cse27 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse60 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse59 (+ v_z_99 .cse39))) (or (< 65535 v_z_99) (= .cse59 .cse34) (< .cse54 .cse60) (< .cse60 0) (< 65535 .cse60) (< .cse59 65536))))) (forall ((v_z_99 Int)) (let ((.cse61 (+ v_z_99 .cse39))) (or (= .cse25 .cse61) (< 65535 .cse61) (< v_z_99 0) (forall ((v_y_99 Int)) (let ((.cse62 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse54 .cse62) (< .cse62 .cse31) (< 65535 .cse62))))))) (or .cse27 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse63 (+ v_z_99 .cse39)) (.cse64 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse25 .cse63) (< 65535 v_z_99) (= .cse63 .cse34) (< .cse54 .cse64) (< v_z_99 0) (< .cse64 0) (< 65535 .cse64))))) (or .cse27 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse65 (+ v_z_99 .cse39)) (.cse66 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse25 .cse65) (< 65535 .cse65) (< .cse54 .cse66) (< v_z_99 0) (< .cse66 0) (< 65535 .cse66))))) (forall ((v_z_99 Int)) (let ((.cse67 (+ v_z_99 .cse39))) (or (< 65535 v_z_99) (= .cse67 .cse34) (forall ((v_y_99 Int)) (let ((.cse68 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse54 .cse68) (< .cse68 .cse31) (< 65535 .cse68)))) (< .cse67 65536)))) (forall ((v_z_99 Int)) (let ((.cse69 (+ v_z_99 .cse39))) (or (= .cse25 .cse69) (< 65535 v_z_99) (= .cse69 .cse34) (< v_z_99 0) (forall ((v_y_99 Int)) (let ((.cse70 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse54 .cse70) (< .cse70 .cse31) (< 65535 .cse70)))))))) .cse28) (or .cse27 .cse28 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse72 (+ v_z_98 .cse26)) (.cse71 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< .cse22 .cse71) (< 65535 .cse72) (< v_z_98 0) (< .cse71 0) (= .cse25 .cse72) (< .cse54 .cse71))))) (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse73 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< v_z_98 0) (< 65535 .cse73) (< .cse73 .cse31) (< 65535 v_z_98) (< .cse54 .cse73)))) .cse29))) (or .cse8 (and (or .cse6 .cse7 (< .cse54 .cse74) .cse5) (or .cse3 (< .cse54 .cse31) .cse4 .cse5))) .cse75 .cse21 .cse76)) .cse2) (or (< c_~var_1_13~0 .cse1) .cse0 .cse2) (or .cse10 .cse9) (or (< |c_ULTIMATE.start_step_~stepLocal_4~0#1| .cse1) .cse0 .cse2)))))) is different from false [2023-12-20 20:27:26,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:27:30,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:27:34,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:27:38,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:27:40,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:27:55,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:27:59,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:28:03,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:28:22,998 WARN L293 SmtUtils]: Spent 5.86s on a formula simplification. DAG size of input: 279 DAG size of output: 261 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 20:28:27,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:28:31,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:28:35,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:28:39,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:28:43,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:28:47,499 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse40 (mod c_~var_1_5~0 65536)) (.cse2 (mod c_~var_1_7~0 65536))) (let ((.cse13 (+ .cse2 1)) (.cse55 (* 65535 c_~var_1_7~0)) (.cse47 (mod c_~var_1_4~0 65536)) (.cse45 (mod c_~var_1_6~0 65536)) (.cse6 (mod c_~var_1_17~0 4294967296)) (.cse48 (mod c_~var_1_8~0 256)) (.cse4 (mod c_~var_1_1~0 65536)) (.cse41 (+ .cse40 1)) (.cse0 (= (mod c_~last_1_var_1_8~0 256) 0)) (.cse30 (* 65535 c_~var_1_5~0))) (let ((.cse8 (mod (+ .cse30 c_~var_1_4~0) 65536)) (.cse38 (not .cse0)) (.cse43 (< .cse2 .cse41)) (.cse39 (< .cse40 .cse2)) (.cse42 (= .cse4 .cse40)) (.cse35 (= 0 .cse48)) (.cse37 (mod c_~var_1_16~0 65536)) (.cse36 (+ .cse40 c_~var_1_11~0)) (.cse34 (mod c_~var_1_14~0 65536)) (.cse51 (< .cse45 (+ .cse6 1))) (.cse50 (= .cse45 .cse40)) (.cse46 (= (mod c_~var_1_9~0 256) 0)) (.cse52 (or (= c_~var_1_13~0 c_~var_1_10~0) (< .cse6 .cse45))) (.cse49 (= (+ 65536 c_~var_1_10~0) .cse47)) (.cse15 (= .cse4 (mod (+ .cse30 c_~var_1_4~0 .cse55) 65536))) (.cse14 (< 56892 .cse47)) (.cse44 (< .cse45 .cse13)) (.cse1 (= .cse4 (mod (+ .cse30 .cse55 56892) 65536))) (.cse9 (< .cse47 56893))) (and (or .cse0 (let ((.cse7 (+ .cse4 65536))) (and (or .cse1 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse3 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse5 (+ v_z_98 .cse8))) (or (< .cse2 .cse3) (< v_z_98 0) (< .cse3 0) (< 65535 v_z_98) (= .cse4 .cse5) (< .cse6 .cse3) (= .cse5 .cse7)))) .cse9) (or .cse1 .cse9 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse10 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse11 (+ v_z_98 .cse8))) (or (< .cse2 .cse10) (< .cse10 0) (< 65535 v_z_98) (< .cse11 65536) (< .cse6 .cse10) (= .cse11 .cse7))))) (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse12 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 (+ v_z_98 .cse8)) (< v_z_98 0) (< 65535 .cse12) (< .cse12 .cse13) (< .cse6 .cse12)))) .cse14) (or .cse14 .cse15) (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse16 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 .cse16) (< .cse16 .cse13) (< 65535 v_z_98) (< (+ v_z_98 .cse8) 65536) (< .cse6 .cse16)))) .cse14) (or (let ((.cse19 (mod (+ .cse30 56892) 65536))) (and (or .cse1 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse18 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse17 (+ v_z_99 .cse19))) (or (< 65535 v_z_99) (= .cse17 .cse7) (< .cse6 .cse18) (< .cse18 0) (< 65535 .cse18) (< .cse17 65536))))) (forall ((v_z_99 Int)) (let ((.cse20 (+ v_z_99 .cse19))) (or (= .cse4 .cse20) (< 65535 .cse20) (< v_z_99 0) (forall ((v_y_99 Int)) (let ((.cse21 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse6 .cse21) (< .cse21 .cse13) (< 65535 .cse21))))))) (or .cse1 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse22 (+ v_z_99 .cse19)) (.cse23 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse4 .cse22) (< 65535 v_z_99) (= .cse22 .cse7) (< .cse6 .cse23) (< v_z_99 0) (< .cse23 0) (< 65535 .cse23))))) (or .cse1 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse24 (+ v_z_99 .cse19)) (.cse25 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse4 .cse24) (< 65535 .cse24) (< .cse6 .cse25) (< v_z_99 0) (< .cse25 0) (< 65535 .cse25))))) (forall ((v_z_99 Int)) (let ((.cse26 (+ v_z_99 .cse19))) (or (< 65535 v_z_99) (= .cse26 .cse7) (forall ((v_y_99 Int)) (let ((.cse27 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse6 .cse27) (< .cse27 .cse13) (< 65535 .cse27)))) (< .cse26 65536)))) (forall ((v_z_99 Int)) (let ((.cse28 (+ v_z_99 .cse19))) (or (= .cse4 .cse28) (< 65535 v_z_99) (= .cse28 .cse7) (< v_z_99 0) (forall ((v_y_99 Int)) (let ((.cse29 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse6 .cse29) (< .cse29 .cse13) (< 65535 .cse29))))))))) .cse9) (or .cse1 .cse9 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse32 (+ v_z_98 .cse8)) (.cse31 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< .cse2 .cse31) (< 65535 .cse32) (< v_z_98 0) (< .cse31 0) (= .cse4 .cse32) (< .cse6 .cse31))))) (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse33 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< v_z_98 0) (< 65535 .cse33) (< .cse33 .cse13) (< 65535 v_z_98) (< .cse6 .cse33)))) .cse14)))) (or (= .cse8 .cse34) .cse35 (< .cse36 (+ .cse37 1))) (or .cse38 (and (or .cse39 (< 65534 .cse40) (< .cse6 .cse41) .cse42) (or .cse43 (< .cse6 .cse13) (< 65534 .cse2) .cse42))) (or .cse38 (and (or .cse43 .cse42 .cse44) (or (< .cse45 .cse41) .cse39 .cse42))) (or (and (or (not .cse46) (and (<= .cse40 .cse2) (<= .cse4 .cse47))) (= 1 .cse48)) (and .cse35 (or (< .cse2 .cse40) (< .cse47 .cse4)) .cse46)) |c_ULTIMATE.start_property_#t~short41#1| (or .cse49 (and (or (and .cse50 (<= .cse47 32767) (= .cse47 c_~var_1_10~0) .cse46) .cse51) .cse52)) (or .cse35 (< .cse37 .cse36) (= .cse34 (mod (+ c_~var_1_4~0 (* c_~var_1_16~0 65535) c_~var_1_11~0) 65536))) (or (and (or .cse51 (and .cse50 (<= 32768 .cse47) .cse46)) .cse52) (not .cse49)) (or (let ((.cse53 (< .cse2 .cse45)) (.cse54 (* c_~var_1_6~0 65535))) (and (or .cse53 .cse14 .cse15) (or (and (or .cse1 .cse53 .cse9) (or .cse14 .cse44)) (= .cse4 (mod (+ .cse30 .cse54 c_~var_1_4~0) 65536))) (or (and .cse1 (<= .cse45 .cse2)) (= .cse4 (mod (+ .cse30 .cse54 56892) 65536)) .cse9))) .cse0))))) is different from false [2023-12-20 20:28:48,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:29:34,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:29:38,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:29:42,586 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (mod c_~var_1_5~0 65536)) (.cse100 (* 65535 c_~var_1_5~0)) (.cse16 (mod c_~var_1_4~0 65536))) (let ((.cse26 (< 56892 .cse16)) (.cse101 (* 65535 c_~var_1_7~0)) (.cse23 (mod (+ .cse100 c_~var_1_4~0) 65536)) (.cse75 (mod c_~var_1_14~0 65536)) (.cse99 (+ .cse15 c_~var_1_11~0)) (.cse98 (mod c_~var_1_16~0 65536)) (.cse22 (mod c_~var_1_1~0 65536)) (.cse19 (mod c_~var_1_7~0 65536)) (.cse72 (+ .cse15 1)) (.cse7 (= (mod c_~last_1_var_1_8~0 256) 0))) (let ((.cse5 (not .cse7)) (.cse0 (< .cse19 .cse72)) (.cse1 (< 65534 .cse19)) (.cse3 (< .cse15 .cse19)) (.cse4 (< 65534 .cse15)) (.cse2 (= .cse22 .cse15)) (.cse73 (or (= .cse23 .cse75) (< .cse99 (+ .cse98 1)))) (.cse18 (= 1 (mod c_~var_1_8~0 256))) (.cse17 (or .cse26 (= .cse22 (mod (+ .cse100 c_~var_1_4~0 .cse101) 65536)))) (.cse28 (+ .cse19 1)) (.cse36 (mod (+ .cse100 56892) 65536)) (.cse31 (+ .cse22 65536)) (.cse24 (= .cse22 (mod (+ .cse100 .cse101 56892) 65536))) (.cse25 (< .cse16 56893)) (.cse74 (or (< .cse98 .cse99) (= .cse75 (mod (+ c_~var_1_4~0 (* c_~var_1_16~0 65535) c_~var_1_11~0) 65536)))) (.cse49 (= (mod c_~var_1_9~0 256) 0))) (and (or (let ((.cse8 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse47 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse48 (+ v_z_98 .cse23))) (or (< .cse19 .cse47) (< .cse47 0) (< 65535 v_z_98) (< .cse48 65536) (= .cse48 .cse31)))) .cse24 .cse25)) (.cse9 (or .cse25 (and (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse34 (+ v_z_99 .cse36)) (.cse35 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse34) (< 65535 v_z_99) (= .cse34 .cse31) (< v_z_99 0) (< .cse35 .cse28) (< 65535 .cse35)))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse38 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse37 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse37 .cse31) (< .cse38 0) (< 65535 .cse38) (< .cse37 65536))))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse39 (+ v_z_99 .cse36)) (.cse40 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse39) (< 65535 .cse39) (< v_z_99 0) (< .cse40 0) (< 65535 .cse40))))) (or (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse41 (+ v_z_99 .cse36)) (.cse42 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse41) (< 65535 v_z_99) (= .cse41 .cse31) (< v_z_99 0) (< .cse42 0) (< 65535 .cse42)))) .cse24) (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse43 (+ v_z_99 .cse36)) (.cse44 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse43) (< 65535 .cse43) (< v_z_99 0) (< .cse44 .cse28) (< 65535 .cse44)))) (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse46 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse45 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse45 .cse31) (< .cse46 .cse28) (< 65535 .cse46) (< .cse45 65536))))))) (.cse10 (or .cse26 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse33 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 (+ v_z_98 .cse23)) (< v_z_98 0) (< 65535 .cse33) (< .cse33 .cse28)))))) (.cse11 (or .cse26 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse32 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< v_z_98 0) (< 65535 .cse32) (< .cse32 .cse28) (< 65535 v_z_98)))))) (.cse12 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse29 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse30 (+ v_z_98 .cse23))) (or (< .cse19 .cse29) (< v_z_98 0) (< .cse29 0) (< 65535 v_z_98) (= .cse22 .cse30) (= .cse30 .cse31)))) .cse24 .cse25)) (.cse13 (or .cse26 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse27 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 .cse27) (< .cse27 .cse28) (< 65535 v_z_98) (< (+ v_z_98 .cse23) 65536)))))) (.cse14 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse20 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse21 (+ v_z_98 .cse23))) (or (< .cse19 .cse20) (< 65535 .cse21) (< v_z_98 0) (< .cse20 0) (= .cse22 .cse21)))) .cse24 .cse25)) (.cse6 (< c_~var_1_13~0 0))) (and (or (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse2)) .cse5 .cse6) (or .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (< (+ (* 65536 (div (+ (* (- 1) .cse15) .cse16) 65536)) c_~var_1_13~0 .cse15) .cse16)) (or .cse7 .cse6 (and .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (or .cse18 .cse6))) .cse49) (or (let ((.cse52 (mod c_~var_1_17~0 4294967296))) (and (or .cse7 (and (or .cse24 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse50 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse51 (+ v_z_98 .cse23))) (or (< .cse19 .cse50) (< v_z_98 0) (< .cse50 0) (< 65535 v_z_98) (= .cse22 .cse51) (< .cse52 .cse50) (= .cse51 .cse31)))) .cse25) (or .cse24 .cse25 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse53 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse54 (+ v_z_98 .cse23))) (or (< .cse19 .cse53) (< .cse53 0) (< 65535 v_z_98) (< .cse54 65536) (< .cse52 .cse53) (= .cse54 .cse31))))) (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse55 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 (+ v_z_98 .cse23)) (< v_z_98 0) (< 65535 .cse55) (< .cse55 .cse28) (< .cse52 .cse55)))) .cse26) .cse17 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse56 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 .cse56) (< .cse56 .cse28) (< 65535 v_z_98) (< (+ v_z_98 .cse23) 65536) (< .cse52 .cse56)))) .cse26) (or (and (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse58 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse57 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse57 .cse31) (< .cse52 .cse58) (< .cse58 0) (< 65535 .cse58) (< .cse57 65536))))) (forall ((v_z_99 Int)) (let ((.cse59 (+ v_z_99 .cse36))) (or (= .cse22 .cse59) (< 65535 .cse59) (< v_z_99 0) (forall ((v_y_99 Int)) (let ((.cse60 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse52 .cse60) (< .cse60 .cse28) (< 65535 .cse60))))))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse61 (+ v_z_99 .cse36)) (.cse62 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse61) (< 65535 v_z_99) (= .cse61 .cse31) (< .cse52 .cse62) (< v_z_99 0) (< .cse62 0) (< 65535 .cse62))))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse63 (+ v_z_99 .cse36)) (.cse64 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse63) (< 65535 .cse63) (< .cse52 .cse64) (< v_z_99 0) (< .cse64 0) (< 65535 .cse64))))) (forall ((v_z_99 Int)) (let ((.cse65 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse65 .cse31) (forall ((v_y_99 Int)) (let ((.cse66 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse52 .cse66) (< .cse66 .cse28) (< 65535 .cse66)))) (< .cse65 65536)))) (forall ((v_z_99 Int)) (let ((.cse67 (+ v_z_99 .cse36))) (or (= .cse22 .cse67) (< 65535 v_z_99) (= .cse67 .cse31) (< v_z_99 0) (forall ((v_y_99 Int)) (let ((.cse68 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse52 .cse68) (< .cse68 .cse28) (< 65535 .cse68)))))))) .cse25) (or .cse24 .cse25 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse70 (+ v_z_98 .cse23)) (.cse69 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< .cse19 .cse69) (< 65535 .cse70) (< v_z_98 0) (< .cse69 0) (= .cse22 .cse70) (< .cse52 .cse69))))) (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse71 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< v_z_98 0) (< 65535 .cse71) (< .cse71 .cse28) (< 65535 v_z_98) (< .cse52 .cse71)))) .cse26))) (or .cse5 (and (or .cse3 .cse4 (< .cse52 .cse72) .cse2) (or .cse0 (< .cse52 .cse28) .cse1 .cse2))) .cse73 .cse18 .cse74)) .cse49) (or (< c_~var_1_13~0 .cse75) (let ((.cse76 (mod c_~var_1_11~0 4294967296))) (and (or .cse5 (and (or .cse0 .cse1 .cse2 (< .cse76 .cse28)) (or .cse3 (< .cse76 .cse72) .cse4 .cse2))) .cse73 .cse18 (or .cse7 (and (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse77 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 .cse77) (< .cse76 .cse77) (< .cse77 .cse28) (< 65535 v_z_98) (< (+ v_z_98 .cse23) 65536)))) .cse26) .cse17 (or .cse26 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse78 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< v_z_98 0) (< 65535 .cse78) (< .cse76 .cse78) (< .cse78 .cse28) (< 65535 v_z_98))))) (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse79 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 (+ v_z_98 .cse23)) (< v_z_98 0) (< 65535 .cse79) (< .cse76 .cse79) (< .cse79 .cse28)))) .cse26) (or .cse25 (and (forall ((v_z_99 Int)) (let ((.cse80 (+ v_z_99 .cse36))) (or (= .cse22 .cse80) (< 65535 .cse80) (forall ((v_y_99 Int)) (let ((.cse81 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse76 .cse81) (< .cse81 .cse28) (< 65535 .cse81)))) (< v_z_99 0)))) (or (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse82 (+ v_z_99 .cse36)) (.cse83 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse82) (< 65535 .cse82) (< .cse76 .cse83) (< v_z_99 0) (< .cse83 0) (< 65535 .cse83)))) .cse24) (forall ((v_z_99 Int)) (let ((.cse84 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse84 .cse31) (forall ((v_y_99 Int)) (let ((.cse85 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse76 .cse85) (< .cse85 .cse28) (< 65535 .cse85)))) (< .cse84 65536)))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse86 (+ v_z_99 .cse36)) (.cse87 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse86) (< 65535 v_z_99) (= .cse86 .cse31) (< .cse76 .cse87) (< v_z_99 0) (< .cse87 0) (< 65535 .cse87))))) (forall ((v_z_99 Int)) (let ((.cse88 (+ v_z_99 .cse36))) (or (= .cse22 .cse88) (< 65535 v_z_99) (= .cse88 .cse31) (forall ((v_y_99 Int)) (let ((.cse89 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse76 .cse89) (< .cse89 .cse28) (< 65535 .cse89)))) (< v_z_99 0)))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse91 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse90 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse90 .cse31) (< .cse76 .cse91) (< .cse91 0) (< 65535 .cse91) (< .cse90 65536))))))) (or .cse24 .cse25 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse92 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse93 (+ v_z_98 .cse23))) (or (< .cse19 .cse92) (< .cse92 0) (< .cse76 .cse92) (< 65535 v_z_98) (< .cse93 65536) (= .cse93 .cse31))))) (or .cse24 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse94 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse95 (+ v_z_98 .cse23))) (or (< .cse19 .cse94) (< v_z_98 0) (< .cse94 0) (< .cse76 .cse94) (< 65535 v_z_98) (= .cse22 .cse95) (= .cse95 .cse31)))) .cse25) (or .cse24 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse96 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse97 (+ v_z_98 .cse23))) (or (< .cse19 .cse96) (< 65535 .cse97) (< v_z_98 0) (< .cse96 0) (< .cse76 .cse96) (= .cse22 .cse97)))) .cse25))) .cse74)) .cse49) |c_ULTIMATE.start_property_#t~short41#1|)))) is different from false [2023-12-20 20:29:46,623 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (mod c_~var_1_5~0 65536)) (.cse16 (mod c_~var_1_4~0 65536))) (let ((.cse26 (< 56892 .cse16)) (.cse76 (* 65535 c_~var_1_5~0)) (.cse77 (* 65535 c_~var_1_7~0)) (.cse22 (mod c_~var_1_1~0 65536)) (.cse19 (mod c_~var_1_7~0 65536)) (.cse52 (+ .cse15 1)) (.cse7 (= (mod c_~last_1_var_1_8~0 256) 0))) (let ((.cse5 (not .cse7)) (.cse0 (< .cse19 .cse52)) (.cse1 (< 65534 .cse19)) (.cse3 (< .cse15 .cse19)) (.cse4 (< 65534 .cse15)) (.cse2 (= .cse22 .cse15)) (.cse18 (= 1 (mod c_~var_1_8~0 256))) (.cse17 (or .cse26 (= .cse22 (mod (+ .cse76 c_~var_1_4~0 .cse77) 65536)))) (.cse28 (+ .cse19 1)) (.cse36 (mod (+ .cse76 56892) 65536)) (.cse31 (+ .cse22 65536)) (.cse24 (= .cse22 (mod (+ .cse76 .cse77 56892) 65536))) (.cse23 (mod (+ .cse76 c_~var_1_4~0) 65536)) (.cse25 (< .cse16 56893)) (.cse49 (= (mod c_~var_1_9~0 256) 0)) (.cse6 (< c_~var_1_13~0 0))) (and (or (let ((.cse8 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse47 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse48 (+ v_z_98 .cse23))) (or (< .cse19 .cse47) (< .cse47 0) (< 65535 v_z_98) (< .cse48 65536) (= .cse48 .cse31)))) .cse24 .cse25)) (.cse9 (or .cse25 (and (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse34 (+ v_z_99 .cse36)) (.cse35 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse34) (< 65535 v_z_99) (= .cse34 .cse31) (< v_z_99 0) (< .cse35 .cse28) (< 65535 .cse35)))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse38 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse37 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse37 .cse31) (< .cse38 0) (< 65535 .cse38) (< .cse37 65536))))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse39 (+ v_z_99 .cse36)) (.cse40 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse39) (< 65535 .cse39) (< v_z_99 0) (< .cse40 0) (< 65535 .cse40))))) (or (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse41 (+ v_z_99 .cse36)) (.cse42 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse41) (< 65535 v_z_99) (= .cse41 .cse31) (< v_z_99 0) (< .cse42 0) (< 65535 .cse42)))) .cse24) (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse43 (+ v_z_99 .cse36)) (.cse44 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse43) (< 65535 .cse43) (< v_z_99 0) (< .cse44 .cse28) (< 65535 .cse44)))) (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse46 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse45 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse45 .cse31) (< .cse46 .cse28) (< 65535 .cse46) (< .cse45 65536))))))) (.cse10 (or .cse26 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse33 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 (+ v_z_98 .cse23)) (< v_z_98 0) (< 65535 .cse33) (< .cse33 .cse28)))))) (.cse11 (or .cse26 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse32 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< v_z_98 0) (< 65535 .cse32) (< .cse32 .cse28) (< 65535 v_z_98)))))) (.cse12 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse29 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse30 (+ v_z_98 .cse23))) (or (< .cse19 .cse29) (< v_z_98 0) (< .cse29 0) (< 65535 v_z_98) (= .cse22 .cse30) (= .cse30 .cse31)))) .cse24 .cse25)) (.cse13 (or .cse26 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse27 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 .cse27) (< .cse27 .cse28) (< 65535 v_z_98) (< (+ v_z_98 .cse23) 65536)))))) (.cse14 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse20 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse21 (+ v_z_98 .cse23))) (or (< .cse19 .cse20) (< 65535 .cse21) (< v_z_98 0) (< .cse20 0) (= .cse22 .cse21)))) .cse24 .cse25))) (and (or (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse2)) .cse5 .cse6) (or .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (< (+ (* 65536 (div (+ (* (- 1) .cse15) .cse16) 65536)) c_~var_1_13~0 .cse15) .cse16)) (or .cse7 .cse6 (and .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (or .cse18 .cse6))) .cse49) (or .cse4 .cse6 .cse2) (let ((.cse50 (mod c_~var_1_14~0 65536))) (or (< c_~var_1_13~0 .cse50) (let ((.cse51 (mod c_~var_1_11~0 4294967296)) (.cse54 (mod c_~var_1_16~0 65536)) (.cse53 (+ .cse15 c_~var_1_11~0))) (and (or .cse5 (and (or .cse0 .cse1 .cse2 (< .cse51 .cse28)) (or .cse3 (< .cse51 .cse52) .cse4 .cse2))) (or (= .cse23 .cse50) (< .cse53 (+ .cse54 1))) .cse18 (or .cse7 (and (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse55 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 .cse55) (< .cse51 .cse55) (< .cse55 .cse28) (< 65535 v_z_98) (< (+ v_z_98 .cse23) 65536)))) .cse26) .cse17 (or .cse26 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse56 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< v_z_98 0) (< 65535 .cse56) (< .cse51 .cse56) (< .cse56 .cse28) (< 65535 v_z_98))))) (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse57 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 (+ v_z_98 .cse23)) (< v_z_98 0) (< 65535 .cse57) (< .cse51 .cse57) (< .cse57 .cse28)))) .cse26) (or .cse25 (and (forall ((v_z_99 Int)) (let ((.cse58 (+ v_z_99 .cse36))) (or (= .cse22 .cse58) (< 65535 .cse58) (forall ((v_y_99 Int)) (let ((.cse59 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse51 .cse59) (< .cse59 .cse28) (< 65535 .cse59)))) (< v_z_99 0)))) (or (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse60 (+ v_z_99 .cse36)) (.cse61 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse60) (< 65535 .cse60) (< .cse51 .cse61) (< v_z_99 0) (< .cse61 0) (< 65535 .cse61)))) .cse24) (forall ((v_z_99 Int)) (let ((.cse62 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse62 .cse31) (forall ((v_y_99 Int)) (let ((.cse63 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse51 .cse63) (< .cse63 .cse28) (< 65535 .cse63)))) (< .cse62 65536)))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse64 (+ v_z_99 .cse36)) (.cse65 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse64) (< 65535 v_z_99) (= .cse64 .cse31) (< .cse51 .cse65) (< v_z_99 0) (< .cse65 0) (< 65535 .cse65))))) (forall ((v_z_99 Int)) (let ((.cse66 (+ v_z_99 .cse36))) (or (= .cse22 .cse66) (< 65535 v_z_99) (= .cse66 .cse31) (forall ((v_y_99 Int)) (let ((.cse67 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse51 .cse67) (< .cse67 .cse28) (< 65535 .cse67)))) (< v_z_99 0)))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse69 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse68 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse68 .cse31) (< .cse51 .cse69) (< .cse69 0) (< 65535 .cse69) (< .cse68 65536))))))) (or .cse24 .cse25 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse70 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse71 (+ v_z_98 .cse23))) (or (< .cse19 .cse70) (< .cse70 0) (< .cse51 .cse70) (< 65535 v_z_98) (< .cse71 65536) (= .cse71 .cse31))))) (or .cse24 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse72 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse73 (+ v_z_98 .cse23))) (or (< .cse19 .cse72) (< v_z_98 0) (< .cse72 0) (< .cse51 .cse72) (< 65535 v_z_98) (= .cse22 .cse73) (= .cse73 .cse31)))) .cse25) (or .cse24 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse74 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse75 (+ v_z_98 .cse23))) (or (< .cse19 .cse74) (< 65535 .cse75) (< v_z_98 0) (< .cse74 0) (< .cse51 .cse74) (= .cse22 .cse75)))) .cse25))) (or (< .cse54 .cse53) (= .cse50 (mod (+ c_~var_1_4~0 (* c_~var_1_16~0 65535) c_~var_1_11~0) 65536))))) .cse49)) (or .cse7 .cse6) |c_ULTIMATE.start_property_#t~short41#1|)))) is different from false [2023-12-20 20:29:54,563 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (mod c_~var_1_5~0 65536)) (.cse100 (* 65535 c_~var_1_5~0)) (.cse16 (mod c_~var_1_4~0 65536))) (let ((.cse26 (< 56892 .cse16)) (.cse101 (* 65535 c_~var_1_7~0)) (.cse23 (mod (+ .cse100 c_~var_1_4~0) 65536)) (.cse75 (mod c_~var_1_14~0 65536)) (.cse99 (+ .cse15 c_~var_1_11~0)) (.cse98 (mod c_~var_1_16~0 65536)) (.cse22 (mod c_~var_1_1~0 65536)) (.cse19 (mod c_~var_1_7~0 65536)) (.cse72 (+ .cse15 1)) (.cse7 (= (mod c_~last_1_var_1_8~0 256) 0))) (let ((.cse5 (not .cse7)) (.cse0 (< .cse19 .cse72)) (.cse1 (< 65534 .cse19)) (.cse3 (< .cse15 .cse19)) (.cse4 (< 65534 .cse15)) (.cse2 (= .cse22 .cse15)) (.cse73 (or (= .cse23 .cse75) (< .cse99 (+ .cse98 1)))) (.cse18 (= 1 (mod c_~var_1_8~0 256))) (.cse17 (or .cse26 (= .cse22 (mod (+ .cse100 c_~var_1_4~0 .cse101) 65536)))) (.cse28 (+ .cse19 1)) (.cse36 (mod (+ .cse100 56892) 65536)) (.cse31 (+ .cse22 65536)) (.cse24 (= .cse22 (mod (+ .cse100 .cse101 56892) 65536))) (.cse25 (< .cse16 56893)) (.cse74 (or (< .cse98 .cse99) (= .cse75 (mod (+ c_~var_1_4~0 (* c_~var_1_16~0 65535) c_~var_1_11~0) 65536)))) (.cse49 (= (mod c_~var_1_9~0 256) 0)) (.cse6 (< c_~var_1_13~0 0))) (and (or (let ((.cse8 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse47 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse48 (+ v_z_98 .cse23))) (or (< .cse19 .cse47) (< .cse47 0) (< 65535 v_z_98) (< .cse48 65536) (= .cse48 .cse31)))) .cse24 .cse25)) (.cse9 (or .cse25 (and (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse34 (+ v_z_99 .cse36)) (.cse35 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse34) (< 65535 v_z_99) (= .cse34 .cse31) (< v_z_99 0) (< .cse35 .cse28) (< 65535 .cse35)))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse38 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse37 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse37 .cse31) (< .cse38 0) (< 65535 .cse38) (< .cse37 65536))))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse39 (+ v_z_99 .cse36)) (.cse40 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse39) (< 65535 .cse39) (< v_z_99 0) (< .cse40 0) (< 65535 .cse40))))) (or (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse41 (+ v_z_99 .cse36)) (.cse42 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse41) (< 65535 v_z_99) (= .cse41 .cse31) (< v_z_99 0) (< .cse42 0) (< 65535 .cse42)))) .cse24) (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse43 (+ v_z_99 .cse36)) (.cse44 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse43) (< 65535 .cse43) (< v_z_99 0) (< .cse44 .cse28) (< 65535 .cse44)))) (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse46 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse45 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse45 .cse31) (< .cse46 .cse28) (< 65535 .cse46) (< .cse45 65536))))))) (.cse10 (or .cse26 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse33 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 (+ v_z_98 .cse23)) (< v_z_98 0) (< 65535 .cse33) (< .cse33 .cse28)))))) (.cse11 (or .cse26 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse32 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< v_z_98 0) (< 65535 .cse32) (< .cse32 .cse28) (< 65535 v_z_98)))))) (.cse12 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse29 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse30 (+ v_z_98 .cse23))) (or (< .cse19 .cse29) (< v_z_98 0) (< .cse29 0) (< 65535 v_z_98) (= .cse22 .cse30) (= .cse30 .cse31)))) .cse24 .cse25)) (.cse13 (or .cse26 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse27 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 .cse27) (< .cse27 .cse28) (< 65535 v_z_98) (< (+ v_z_98 .cse23) 65536)))))) (.cse14 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse20 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse21 (+ v_z_98 .cse23))) (or (< .cse19 .cse20) (< 65535 .cse21) (< v_z_98 0) (< .cse20 0) (= .cse22 .cse21)))) .cse24 .cse25))) (and (or (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse2)) .cse5 .cse6) (or .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (< (+ (* 65536 (div (+ (* (- 1) .cse15) .cse16) 65536)) c_~var_1_13~0 .cse15) .cse16)) (or .cse7 .cse6 (and .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (or .cse18 .cse6))) .cse49) (or (let ((.cse52 (mod c_~var_1_17~0 4294967296))) (and (or .cse7 (and (or .cse24 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse50 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse51 (+ v_z_98 .cse23))) (or (< .cse19 .cse50) (< v_z_98 0) (< .cse50 0) (< 65535 v_z_98) (= .cse22 .cse51) (< .cse52 .cse50) (= .cse51 .cse31)))) .cse25) (or .cse24 .cse25 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse53 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse54 (+ v_z_98 .cse23))) (or (< .cse19 .cse53) (< .cse53 0) (< 65535 v_z_98) (< .cse54 65536) (< .cse52 .cse53) (= .cse54 .cse31))))) (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse55 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 (+ v_z_98 .cse23)) (< v_z_98 0) (< 65535 .cse55) (< .cse55 .cse28) (< .cse52 .cse55)))) .cse26) .cse17 (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse56 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 .cse56) (< .cse56 .cse28) (< 65535 v_z_98) (< (+ v_z_98 .cse23) 65536) (< .cse52 .cse56)))) .cse26) (or (and (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse58 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse57 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse57 .cse31) (< .cse52 .cse58) (< .cse58 0) (< 65535 .cse58) (< .cse57 65536))))) (forall ((v_z_99 Int)) (let ((.cse59 (+ v_z_99 .cse36))) (or (= .cse22 .cse59) (< 65535 .cse59) (< v_z_99 0) (forall ((v_y_99 Int)) (let ((.cse60 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse52 .cse60) (< .cse60 .cse28) (< 65535 .cse60))))))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse61 (+ v_z_99 .cse36)) (.cse62 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse61) (< 65535 v_z_99) (= .cse61 .cse31) (< .cse52 .cse62) (< v_z_99 0) (< .cse62 0) (< 65535 .cse62))))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse63 (+ v_z_99 .cse36)) (.cse64 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse63) (< 65535 .cse63) (< .cse52 .cse64) (< v_z_99 0) (< .cse64 0) (< 65535 .cse64))))) (forall ((v_z_99 Int)) (let ((.cse65 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse65 .cse31) (forall ((v_y_99 Int)) (let ((.cse66 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse52 .cse66) (< .cse66 .cse28) (< 65535 .cse66)))) (< .cse65 65536)))) (forall ((v_z_99 Int)) (let ((.cse67 (+ v_z_99 .cse36))) (or (= .cse22 .cse67) (< 65535 v_z_99) (= .cse67 .cse31) (< v_z_99 0) (forall ((v_y_99 Int)) (let ((.cse68 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse52 .cse68) (< .cse68 .cse28) (< 65535 .cse68)))))))) .cse25) (or .cse24 .cse25 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse70 (+ v_z_98 .cse23)) (.cse69 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< .cse19 .cse69) (< 65535 .cse70) (< v_z_98 0) (< .cse69 0) (= .cse22 .cse70) (< .cse52 .cse69))))) (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse71 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< v_z_98 0) (< 65535 .cse71) (< .cse71 .cse28) (< 65535 v_z_98) (< .cse52 .cse71)))) .cse26))) (or .cse5 (and (or .cse3 .cse4 (< .cse52 .cse72) .cse2) (or .cse0 (< .cse52 .cse28) .cse1 .cse2))) .cse73 .cse18 .cse74)) .cse49) (or (< c_~var_1_13~0 .cse75) (let ((.cse76 (mod c_~var_1_11~0 4294967296))) (and (or .cse5 (and (or .cse0 .cse1 .cse2 (< .cse76 .cse28)) (or .cse3 (< .cse76 .cse72) .cse4 .cse2))) .cse73 .cse18 (or .cse7 (and (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse77 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 .cse77) (< .cse76 .cse77) (< .cse77 .cse28) (< 65535 v_z_98) (< (+ v_z_98 .cse23) 65536)))) .cse26) .cse17 (or .cse26 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse78 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< v_z_98 0) (< 65535 .cse78) (< .cse76 .cse78) (< .cse78 .cse28) (< 65535 v_z_98))))) (or (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse79 (+ (* v_z_98 65535) (* 65536 v_y_98)))) (or (< 65535 (+ v_z_98 .cse23)) (< v_z_98 0) (< 65535 .cse79) (< .cse76 .cse79) (< .cse79 .cse28)))) .cse26) (or .cse25 (and (forall ((v_z_99 Int)) (let ((.cse80 (+ v_z_99 .cse36))) (or (= .cse22 .cse80) (< 65535 .cse80) (forall ((v_y_99 Int)) (let ((.cse81 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse76 .cse81) (< .cse81 .cse28) (< 65535 .cse81)))) (< v_z_99 0)))) (or (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse82 (+ v_z_99 .cse36)) (.cse83 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse82) (< 65535 .cse82) (< .cse76 .cse83) (< v_z_99 0) (< .cse83 0) (< 65535 .cse83)))) .cse24) (forall ((v_z_99 Int)) (let ((.cse84 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse84 .cse31) (forall ((v_y_99 Int)) (let ((.cse85 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse76 .cse85) (< .cse85 .cse28) (< 65535 .cse85)))) (< .cse84 65536)))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse86 (+ v_z_99 .cse36)) (.cse87 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (= .cse22 .cse86) (< 65535 v_z_99) (= .cse86 .cse31) (< .cse76 .cse87) (< v_z_99 0) (< .cse87 0) (< 65535 .cse87))))) (forall ((v_z_99 Int)) (let ((.cse88 (+ v_z_99 .cse36))) (or (= .cse22 .cse88) (< 65535 v_z_99) (= .cse88 .cse31) (forall ((v_y_99 Int)) (let ((.cse89 (+ (* v_z_99 65535) (* 65536 v_y_99)))) (or (< .cse76 .cse89) (< .cse89 .cse28) (< 65535 .cse89)))) (< v_z_99 0)))) (or .cse24 (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse91 (+ (* v_z_99 65535) (* 65536 v_y_99))) (.cse90 (+ v_z_99 .cse36))) (or (< 65535 v_z_99) (= .cse90 .cse31) (< .cse76 .cse91) (< .cse91 0) (< 65535 .cse91) (< .cse90 65536))))))) (or .cse24 .cse25 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse92 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse93 (+ v_z_98 .cse23))) (or (< .cse19 .cse92) (< .cse92 0) (< .cse76 .cse92) (< 65535 v_z_98) (< .cse93 65536) (= .cse93 .cse31))))) (or .cse24 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse94 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse95 (+ v_z_98 .cse23))) (or (< .cse19 .cse94) (< v_z_98 0) (< .cse94 0) (< .cse76 .cse94) (< 65535 v_z_98) (= .cse22 .cse95) (= .cse95 .cse31)))) .cse25) (or .cse24 (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse96 (+ (* v_z_98 65535) (* 65536 v_y_98))) (.cse97 (+ v_z_98 .cse23))) (or (< .cse19 .cse96) (< 65535 .cse97) (< v_z_98 0) (< .cse96 0) (< .cse76 .cse96) (= .cse22 .cse97)))) .cse25))) .cse74)) .cse49) (or .cse7 .cse6) |c_ULTIMATE.start_property_#t~short41#1|)))) is different from false [2023-12-20 20:30:16,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:30:19,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:30:23,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:30:44,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:30:48,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:30:52,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:30:54,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:30:56,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:31:00,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:31:04,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:31:11,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:31:15,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:31:16,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:31:34,656 WARN L293 SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 266 DAG size of output: 264 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 20:31:37,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:31:41,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:31:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:31:41,732 INFO L93 Difference]: Finished difference Result 636 states and 916 transitions. [2023-12-20 20:31:41,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-20 20:31:41,733 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 293 [2023-12-20 20:31:41,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:31:41,737 INFO L225 Difference]: With dead ends: 636 [2023-12-20 20:31:41,737 INFO L226 Difference]: Without dead ends: 454 [2023-12-20 20:31:41,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 275.4s TimeCoverageRelationStatistics Valid=382, Invalid=1501, Unknown=33, NotChecked=534, Total=2450 [2023-12-20 20:31:41,739 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 250 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 20 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 149.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 150.5s IncrementalHoareTripleChecker+Time [2023-12-20 20:31:41,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1986 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 954 Invalid, 27 Unknown, 142 Unchecked, 150.5s Time] [2023-12-20 20:31:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2023-12-20 20:31:41,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 305. [2023-12-20 20:31:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 189 states have (on average 1.2857142857142858) internal successors, (243), 191 states have internal predecessors, (243), 102 states have call successors, (102), 13 states have call predecessors, (102), 13 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) [2023-12-20 20:31:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 447 transitions. [2023-12-20 20:31:41,798 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 447 transitions. Word has length 293 [2023-12-20 20:31:41,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:31:41,802 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 447 transitions. [2023-12-20 20:31:41,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-12-20 20:31:41,803 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 447 transitions. [2023-12-20 20:31:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-12-20 20:31:41,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:31:41,808 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:31:41,818 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-20 20:31:42,016 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-20 20:31:42,016 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:31:42,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:31:42,017 INFO L85 PathProgramCache]: Analyzing trace with hash 209419570, now seen corresponding path program 1 times [2023-12-20 20:31:42,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:31:42,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512501180] [2023-12-20 20:31:42,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:31:42,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:31:42,056 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:31:42,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [640354283] [2023-12-20 20:31:42,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:31:42,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:31:42,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:31:42,058 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-20 20:31:42,071 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-20 20:31:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:31:42,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 20:31:42,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:31:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1311 proven. 117 refuted. 0 times theorem prover too weak. 3084 trivial. 0 not checked. [2023-12-20 20:31:42,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 20:31:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 24 proven. 117 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2023-12-20 20:31:42,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:31:42,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512501180] [2023-12-20 20:31:42,765 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:31:42,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640354283] [2023-12-20 20:31:42,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640354283] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 20:31:42,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 20:31:42,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-20 20:31:42,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605426938] [2023-12-20 20:31:42,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 20:31:42,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 20:31:42,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:31:42,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 20:31:42,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 20:31:42,768 INFO L87 Difference]: Start difference. First operand 305 states and 447 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2023-12-20 20:31:43,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:31:43,071 INFO L93 Difference]: Finished difference Result 512 states and 741 transitions. [2023-12-20 20:31:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 20:31:43,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) Word has length 293 [2023-12-20 20:31:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:31:43,076 INFO L225 Difference]: With dead ends: 512 [2023-12-20 20:31:43,076 INFO L226 Difference]: Without dead ends: 321 [2023-12-20 20:31:43,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 578 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-20 20:31:43,078 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 105 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 20:31:43,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 289 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 20:31:43,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-12-20 20:31:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 313. [2023-12-20 20:31:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 195 states have (on average 1.2615384615384615) internal successors, (246), 197 states have internal predecessors, (246), 102 states have call successors, (102), 15 states have call predecessors, (102), 15 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) [2023-12-20 20:31:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 450 transitions. [2023-12-20 20:31:43,123 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 450 transitions. Word has length 293 [2023-12-20 20:31:43,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:31:43,124 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 450 transitions. [2023-12-20 20:31:43,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2023-12-20 20:31:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 450 transitions. [2023-12-20 20:31:43,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-12-20 20:31:43,128 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:31:43,129 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:31:43,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-20 20:31:43,335 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-20 20:31:43,336 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:31:43,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:31:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2057983498, now seen corresponding path program 1 times [2023-12-20 20:31:43,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:31:43,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173787480] [2023-12-20 20:31:43,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:31:43,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:31:43,367 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:31:43,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1082651673] [2023-12-20 20:31:43,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:31:43,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:31:43,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:31:43,370 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-20 20:31:43,394 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-20 20:31:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:31:43,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 53 conjunts are in the unsatisfiable core [2023-12-20 20:31:43,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:31:51,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1890 proven. 687 refuted. 0 times theorem prover too weak. 1935 trivial. 0 not checked. [2023-12-20 20:31:51,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 20:33:53,773 WARN L293 SmtUtils]: Spent 35.21s on a formula simplification. DAG size of input: 1281 DAG size of output: 1253 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 20:35:54,316 WARN L293 SmtUtils]: Spent 55.92s on a formula simplification. DAG size of input: 1166 DAG size of output: 1164 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 20:37:22,305 WARN L293 SmtUtils]: Spent 29.10s on a formula simplification that was a NOOP. DAG size: 1168 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 20:37:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2023-12-20 20:37:24,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:37:24,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173787480] [2023-12-20 20:37:24,009 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:37:24,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082651673] [2023-12-20 20:37:24,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082651673] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-20 20:37:24,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 20:37:24,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [30] total 40 [2023-12-20 20:37:24,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205017670] [2023-12-20 20:37:24,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:37:24,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 20:37:24,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:37:24,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 20:37:24,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1212, Unknown=16, NotChecked=0, Total=1560 [2023-12-20 20:37:24,010 INFO L87 Difference]: Start difference. First operand 313 states and 450 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Received shutdown request... [2023-12-20 20:38:02,038 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 20:38:02,039 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 20:38:02,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 20:38:02,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 205.2s TimeCoverageRelationStatistics Valid=332, Invalid=1212, Unknown=16, NotChecked=0, Total=1560 [2023-12-20 20:38:02,289 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 20:38:02,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 20:38:02,290 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 20:38:02,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-20 20:38:02,498 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-20 20:38:02,498 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (313states) and FLOYD_HOARE automaton (currently 2 states, 12 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-3-2-5-3-8-3-16-3-16-2-3-1 term,while SimplifyDDA2 was simplifying 4 xjuncts wrt. a ATOM-1 context. [2023-12-20 20:38:02,502 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-20 20:38:02,504 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 20:38:02,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 08:38:02 BoogieIcfgContainer [2023-12-20 20:38:02,505 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 20:38:02,506 INFO L158 Benchmark]: Toolchain (without parser) took 856205.46ms. Allocated memory was 253.8MB in the beginning and 988.8MB in the end (delta: 735.1MB). Free memory was 203.8MB in the beginning and 801.4MB in the end (delta: -597.6MB). Peak memory consumption was 592.6MB. Max. memory is 8.0GB. [2023-12-20 20:38:02,506 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 196.1MB. Free memory is still 148.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 20:38:02,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.95ms. Allocated memory is still 253.8MB. Free memory was 203.5MB in the beginning and 186.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-20 20:38:02,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.32ms. Allocated memory is still 253.8MB. Free memory was 186.2MB in the beginning and 181.0MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-20 20:38:02,507 INFO L158 Benchmark]: Boogie Preprocessor took 75.82ms. Allocated memory is still 253.8MB. Free memory was 181.0MB in the beginning and 173.1MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-20 20:38:02,507 INFO L158 Benchmark]: RCFGBuilder took 663.51ms. Allocated memory is still 253.8MB. Free memory was 173.1MB in the beginning and 191.8MB in the end (delta: -18.6MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2023-12-20 20:38:02,507 INFO L158 Benchmark]: TraceAbstraction took 855046.95ms. Allocated memory was 253.8MB in the beginning and 988.8MB in the end (delta: 735.1MB). Free memory was 191.2MB in the beginning and 801.4MB in the end (delta: -610.1MB). Peak memory consumption was 579.2MB. Max. memory is 8.0GB. [2023-12-20 20:38:02,509 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.13ms. Allocated memory is still 196.1MB. Free memory is still 148.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 348.95ms. Allocated memory is still 253.8MB. Free memory was 203.5MB in the beginning and 186.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.32ms. Allocated memory is still 253.8MB. Free memory was 186.2MB in the beginning and 181.0MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 75.82ms. Allocated memory is still 253.8MB. Free memory was 181.0MB in the beginning and 173.1MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 663.51ms. Allocated memory is still 253.8MB. Free memory was 173.1MB in the beginning and 191.8MB in the end (delta: -18.6MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * TraceAbstraction took 855046.95ms. Allocated memory was 253.8MB in the beginning and 988.8MB in the end (delta: 735.1MB). Free memory was 191.2MB in the beginning and 801.4MB in the end (delta: -610.1MB). Peak memory consumption was 579.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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was constructing difference of abstraction (313states) and FLOYD_HOARE automaton (currently 2 states, 12 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-3-2-5-3-8-3-16-3-16-2-3-1 term,while SimplifyDDA2 was simplifying 4 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 855.0s, OverallIterations: 6, TraceHistogramMax: 48, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 413.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 1181 SdHoareTripleChecker+Valid, 152.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1160 mSDsluCounter, 3917 SdHoareTripleChecker+Invalid, 150.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 142 IncrementalHoareTripleChecker+Unchecked, 3097 mSDsCounter, 370 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2660 IncrementalHoareTripleChecker+Invalid, 3199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 370 mSolverCounterUnsat, 820 mSDtfsCounter, 2660 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2990 GetRequests, 2818 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2295 ImplicationChecksByTransitivity, 482.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=5, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 236 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 437.8s InterpolantComputationTime, 2048 NumberOfCodeBlocks, 2048 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 2918 ConstructedInterpolants, 23 QuantifiedInterpolants, 77242 SizeOfPredicates, 78 NumberOfNonLiveVariables, 3813 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 43356/45120 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: Timeout Completed graceful shutdown