/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 10:48:41,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 10:48:41,806 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-19 10:48:41,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 10:48:41,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 10:48:41,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 10:48:41,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 10:48:41,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 10:48:41,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 10:48:41,823 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 10:48:41,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 10:48:41,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 10:48:41,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 10:48:41,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 10:48:41,824 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 10:48:41,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 10:48:41,825 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 10:48:41,825 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 10:48:41,825 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 10:48:41,825 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 10:48:41,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 10:48:41,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 10:48:41,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 10:48:41,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 10:48:41,827 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 10:48:41,827 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 10:48:41,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 10:48:41,828 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 10:48:41,828 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 10:48:41,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 10:48:41,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 10:48:41,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 10:48:41,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 10:48:41,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 10:48:41,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 10:48:41,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 10:48:41,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 10:48:41,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 10:48:41,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 10:48:41,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 10:48:41,831 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 10:48:41,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 10:48:41,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 10:48:41,831 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 10:48:41,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 10:48:41,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 10:48:41,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 10:48:41,990 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 10:48:41,990 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 10:48:41,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i [2023-12-19 10:48:43,443 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 10:48:43,630 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 10:48:43,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i [2023-12-19 10:48:43,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b8d39024/b1a51e2c6b7d414a8f9a4da6e53a105d/FLAG3dbebf67e [2023-12-19 10:48:43,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b8d39024/b1a51e2c6b7d414a8f9a4da6e53a105d [2023-12-19 10:48:43,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 10:48:43,652 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 10:48:43,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 10:48:43,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 10:48:43,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 10:48:43,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 10:48:43" (1/1) ... [2023-12-19 10:48:43,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7387c6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:48:43, skipping insertion in model container [2023-12-19 10:48:43,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 10:48:43" (1/1) ... [2023-12-19 10:48:43,689 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 10:48:43,793 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_floatingpointinfluence_no-floats_file-39.i[916,929] [2023-12-19 10:48:43,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 10:48:43,844 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 10:48:43,854 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_floatingpointinfluence_no-floats_file-39.i[916,929] [2023-12-19 10:48:43,867 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 10:48:43,878 INFO L206 MainTranslator]: Completed translation [2023-12-19 10:48:43,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:48:43 WrapperNode [2023-12-19 10:48:43,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 10:48:43,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 10:48:43,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 10:48:43,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 10:48:43,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:48:43" (1/1) ... [2023-12-19 10:48:43,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:48:43" (1/1) ... [2023-12-19 10:48:43,929 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2023-12-19 10:48:43,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 10:48:43,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 10:48:43,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 10:48:43,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 10:48:43,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:48:43" (1/1) ... [2023-12-19 10:48:43,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:48:43" (1/1) ... [2023-12-19 10:48:43,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:48:43" (1/1) ... [2023-12-19 10:48:43,959 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-19 10:48:43,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:48:43" (1/1) ... [2023-12-19 10:48:43,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:48:43" (1/1) ... [2023-12-19 10:48:43,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:48:43" (1/1) ... [2023-12-19 10:48:43,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:48:43" (1/1) ... [2023-12-19 10:48:43,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:48:43" (1/1) ... [2023-12-19 10:48:43,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:48:43" (1/1) ... [2023-12-19 10:48:43,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 10:48:43,968 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 10:48:43,968 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 10:48:43,968 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 10:48:43,969 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:48:43" (1/1) ... [2023-12-19 10:48:43,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 10:48:43,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 10:48:43,992 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-19 10:48:44,009 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-19 10:48:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 10:48:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 10:48:44,023 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 10:48:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 10:48:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 10:48:44,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 10:48:44,094 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 10:48:44,095 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 10:48:44,284 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 10:48:44,311 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 10:48:44,311 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 10:48:44,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 10:48:44 BoogieIcfgContainer [2023-12-19 10:48:44,312 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 10:48:44,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 10:48:44,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 10:48:44,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 10:48:44,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 10:48:43" (1/3) ... [2023-12-19 10:48:44,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3869ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 10:48:44, skipping insertion in model container [2023-12-19 10:48:44,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:48:43" (2/3) ... [2023-12-19 10:48:44,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3869ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 10:48:44, skipping insertion in model container [2023-12-19 10:48:44,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 10:48:44" (3/3) ... [2023-12-19 10:48:44,320 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-39.i [2023-12-19 10:48:44,336 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 10:48:44,336 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 10:48:44,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 10:48:44,398 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;@12dfbdc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 10:48:44,398 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 10:48:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 10:48:44,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 10:48:44,451 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:48:44,452 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:48:44,453 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:48:44,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:48:44,458 INFO L85 PathProgramCache]: Analyzing trace with hash -610482903, now seen corresponding path program 1 times [2023-12-19 10:48:44,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:48:44,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498885923] [2023-12-19 10:48:44,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:48:44,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:48:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:48:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:48:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:48:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:48:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:48:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:48:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:48:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:48:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:48:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:48:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:48:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:48:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:48:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:48:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:48:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:48:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 10:48:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 10:48:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-19 10:48:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:48:44,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:48:44,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498885923] [2023-12-19 10:48:44,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498885923] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:48:44,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:48:44,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 10:48:44,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436873289] [2023-12-19 10:48:44,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:48:44,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 10:48:44,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:48:44,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 10:48:44,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 10:48:44,780 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-19 10:48:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:48:44,812 INFO L93 Difference]: Finished difference Result 99 states and 175 transitions. [2023-12-19 10:48:44,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 10:48:44,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 115 [2023-12-19 10:48:44,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:48:44,819 INFO L225 Difference]: With dead ends: 99 [2023-12-19 10:48:44,819 INFO L226 Difference]: Without dead ends: 49 [2023-12-19 10:48:44,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-19 10:48:44,824 INFO L413 NwaCegarLoop]: 71 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, 71 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-19 10:48:44,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:48:44,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-19 10:48:44,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-19 10:48:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 10:48:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 74 transitions. [2023-12-19 10:48:44,866 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 74 transitions. Word has length 115 [2023-12-19 10:48:44,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:48:44,867 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 74 transitions. [2023-12-19 10:48:44,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-19 10:48:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 74 transitions. [2023-12-19 10:48:44,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 10:48:44,869 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:48:44,869 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:48:44,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 10:48:44,870 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:48:44,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:48:44,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1340042201, now seen corresponding path program 1 times [2023-12-19 10:48:44,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:48:44,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236791857] [2023-12-19 10:48:44,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:48:44,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:48:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:45,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:48:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:45,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:48:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:45,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:48:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:48:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:48:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:48:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:48:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:48:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:48:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:48:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:48:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:48:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:48:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:48:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:48:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:48:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 10:48:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 10:48:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-19 10:48:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:48:46,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:48:46,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236791857] [2023-12-19 10:48:46,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236791857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:48:46,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:48:46,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 10:48:46,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037176678] [2023-12-19 10:48:46,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:48:46,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 10:48:46,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:48:46,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 10:48:46,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 10:48:46,060 INFO L87 Difference]: Start difference. First operand 49 states and 74 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:48:50,387 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 [] [2023-12-19 10:48:54,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-19 10:48:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:48:55,728 INFO L93 Difference]: Finished difference Result 112 states and 167 transitions. [2023-12-19 10:48:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 10:48:55,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 115 [2023-12-19 10:48:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:48:55,730 INFO L225 Difference]: With dead ends: 112 [2023-12-19 10:48:55,730 INFO L226 Difference]: Without dead ends: 64 [2023-12-19 10:48:55,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-19 10:48:55,732 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 49 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-12-19 10:48:55,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 214 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2023-12-19 10:48:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-19 10:48:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2023-12-19 10:48:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 10:48:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2023-12-19 10:48:55,741 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 115 [2023-12-19 10:48:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:48:55,743 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2023-12-19 10:48:55,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:48:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2023-12-19 10:48:55,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 10:48:55,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:48:55,754 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:48:55,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 10:48:55,754 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:48:55,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:48:55,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1851638027, now seen corresponding path program 1 times [2023-12-19 10:48:55,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:48:55,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494016263] [2023-12-19 10:48:55,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:48:55,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:48:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:48:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:48:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:48:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:48:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:48:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:48:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:48:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:48:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:48:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:48:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:48:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:48:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:48:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:48:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:48:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:48:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 10:48:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 10:48:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-19 10:48:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:48:56,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:48:56,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494016263] [2023-12-19 10:48:56,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494016263] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:48:56,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:48:56,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 10:48:56,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397319021] [2023-12-19 10:48:56,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:48:56,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 10:48:56,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:48:56,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 10:48:56,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 10:48:56,801 INFO L87 Difference]: Start difference. First operand 55 states and 83 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:48:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:48:57,631 INFO L93 Difference]: Finished difference Result 132 states and 194 transitions. [2023-12-19 10:48:57,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 10:48:57,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2023-12-19 10:48:57,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:48:57,634 INFO L225 Difference]: With dead ends: 132 [2023-12-19 10:48:57,634 INFO L226 Difference]: Without dead ends: 78 [2023-12-19 10:48:57,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-12-19 10:48:57,635 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 62 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 10:48:57,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 259 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 10:48:57,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-19 10:48:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 55. [2023-12-19 10:48:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 10:48:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2023-12-19 10:48:57,642 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 116 [2023-12-19 10:48:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:48:57,642 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2023-12-19 10:48:57,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:48:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2023-12-19 10:48:57,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 10:48:57,644 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:48:57,644 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:48:57,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 10:48:57,644 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:48:57,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:48:57,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1171579657, now seen corresponding path program 1 times [2023-12-19 10:48:57,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:48:57,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760143563] [2023-12-19 10:48:57,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:48:57,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:48:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:48:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:48:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:48:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:48:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:48:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:48:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:48:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:48:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:48:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:48:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:48:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:48:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:48:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:48:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:48:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:48:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 10:48:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 10:48:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-19 10:48:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:48:58,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:48:58,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760143563] [2023-12-19 10:48:58,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760143563] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:48:58,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:48:58,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 10:48:58,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887016661] [2023-12-19 10:48:58,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:48:58,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 10:48:58,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:48:58,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 10:48:58,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 10:48:58,414 INFO L87 Difference]: Start difference. First operand 55 states and 83 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:48:59,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:48:59,398 INFO L93 Difference]: Finished difference Result 132 states and 193 transitions. [2023-12-19 10:48:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 10:48:59,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2023-12-19 10:48:59,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:48:59,400 INFO L225 Difference]: With dead ends: 132 [2023-12-19 10:48:59,400 INFO L226 Difference]: Without dead ends: 78 [2023-12-19 10:48:59,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-12-19 10:48:59,401 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 53 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 10:48:59,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 229 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 10:48:59,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-19 10:48:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2023-12-19 10:48:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 10:48:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2023-12-19 10:48:59,406 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 116 [2023-12-19 10:48:59,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:48:59,407 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2023-12-19 10:48:59,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:48:59,407 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2023-12-19 10:48:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 10:48:59,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:48:59,408 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:48:59,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 10:48:59,409 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:48:59,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:48:59,409 INFO L85 PathProgramCache]: Analyzing trace with hash 378809548, now seen corresponding path program 1 times [2023-12-19 10:48:59,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:48:59,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120812561] [2023-12-19 10:48:59,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:48:59,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:48:59,419 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 10:48:59,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260669797] [2023-12-19 10:48:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:48:59,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 10:48:59,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 10:48:59,422 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-19 10:48:59,424 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-19 10:48:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:48:59,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-19 10:48:59,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 10:49:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-12-19 10:49:02,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 10:49:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:49:07,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:49:07,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120812561] [2023-12-19 10:49:07,108 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 10:49:07,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260669797] [2023-12-19 10:49:07,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260669797] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-19 10:49:07,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 10:49:07,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 13 [2023-12-19 10:49:07,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766622776] [2023-12-19 10:49:07,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:49:07,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 10:49:07,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:49:07,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 10:49:07,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-19 10:49:07,113 INFO L87 Difference]: Start difference. First operand 49 states and 73 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:49:07,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:49:07,430 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2023-12-19 10:49:07,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 10:49:07,431 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 117 [2023-12-19 10:49:07,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:49:07,432 INFO L225 Difference]: With dead ends: 68 [2023-12-19 10:49:07,432 INFO L226 Difference]: Without dead ends: 66 [2023-12-19 10:49:07,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-12-19 10:49:07,433 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 21 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 10:49:07,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 372 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 10:49:07,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-19 10:49:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2023-12-19 10:49:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 10:49:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2023-12-19 10:49:07,438 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 117 [2023-12-19 10:49:07,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:49:07,438 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2023-12-19 10:49:07,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:49:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2023-12-19 10:49:07,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 10:49:07,440 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:49:07,440 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:49:07,451 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-19 10:49:07,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 10:49:07,644 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:49:07,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:49:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash 380656590, now seen corresponding path program 1 times [2023-12-19 10:49:07,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:49:07,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053154541] [2023-12-19 10:49:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:49:07,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:49:07,657 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 10:49:07,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620835074] [2023-12-19 10:49:07,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:49:07,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 10:49:07,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 10:49:07,659 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-19 10:49:07,709 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-19 10:49:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:49:07,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 10:49:07,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 10:49:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:49:07,760 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 10:49:07,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:49:07,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053154541] [2023-12-19 10:49:07,761 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 10:49:07,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620835074] [2023-12-19 10:49:07,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620835074] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:49:07,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:49:07,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:49:07,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486625032] [2023-12-19 10:49:07,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:49:07,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:49:07,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:49:07,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:49:07,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:49:07,762 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:49:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:49:07,811 INFO L93 Difference]: Finished difference Result 124 states and 178 transitions. [2023-12-19 10:49:07,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:49:07,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 117 [2023-12-19 10:49:07,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:49:07,813 INFO L225 Difference]: With dead ends: 124 [2023-12-19 10:49:07,813 INFO L226 Difference]: Without dead ends: 68 [2023-12-19 10:49:07,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:49:07,814 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:49:07,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 115 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:49:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-19 10:49:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2023-12-19 10:49:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 10:49:07,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2023-12-19 10:49:07,818 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 117 [2023-12-19 10:49:07,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:49:07,819 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2023-12-19 10:49:07,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:49:07,819 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2023-12-19 10:49:07,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 10:49:07,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:49:07,820 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:49:07,829 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-19 10:49:08,026 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,SelfDestructingSolverStorable5 [2023-12-19 10:49:08,027 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:49:08,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:49:08,027 INFO L85 PathProgramCache]: Analyzing trace with hash -14217462, now seen corresponding path program 1 times [2023-12-19 10:49:08,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:49:08,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039224889] [2023-12-19 10:49:08,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:49:08,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:49:08,049 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 10:49:08,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2143297660] [2023-12-19 10:49:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:49:08,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 10:49:08,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 10:49:08,051 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-19 10:49:08,054 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-19 10:49:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:49:08,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 10:49:08,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 10:49:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:49:08,148 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 10:49:08,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:49:08,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039224889] [2023-12-19 10:49:08,149 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 10:49:08,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143297660] [2023-12-19 10:49:08,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143297660] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:49:08,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:49:08,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:49:08,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062643562] [2023-12-19 10:49:08,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:49:08,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:49:08,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:49:08,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:49:08,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:49:08,150 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:49:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:49:08,202 INFO L93 Difference]: Finished difference Result 128 states and 180 transitions. [2023-12-19 10:49:08,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:49:08,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 117 [2023-12-19 10:49:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:49:08,203 INFO L225 Difference]: With dead ends: 128 [2023-12-19 10:49:08,203 INFO L226 Difference]: Without dead ends: 68 [2023-12-19 10:49:08,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:49:08,204 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:49:08,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 125 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:49:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-19 10:49:08,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2023-12-19 10:49:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 10:49:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2023-12-19 10:49:08,209 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 117 [2023-12-19 10:49:08,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:49:08,209 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2023-12-19 10:49:08,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:49:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2023-12-19 10:49:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 10:49:08,210 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:49:08,210 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:49:08,221 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-19 10:49:08,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 10:49:08,417 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:49:08,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:49:08,418 INFO L85 PathProgramCache]: Analyzing trace with hash -12370420, now seen corresponding path program 1 times [2023-12-19 10:49:08,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:49:08,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494615952] [2023-12-19 10:49:08,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:49:08,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:49:08,430 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 10:49:08,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416456171] [2023-12-19 10:49:08,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:49:08,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 10:49:08,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 10:49:08,432 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-19 10:49:08,456 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-19 10:49:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 10:49:08,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 10:49:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 10:49:08,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 10:49:08,564 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 10:49:08,564 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 10:49:08,586 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-19 10:49:08,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 10:49:08,771 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:49:08,774 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 10:49:08,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 10:49:08 BoogieIcfgContainer [2023-12-19 10:49:08,855 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 10:49:08,856 INFO L158 Benchmark]: Toolchain (without parser) took 25204.06ms. Allocated memory was 197.1MB in the beginning and 715.1MB in the end (delta: 518.0MB). Free memory was 142.2MB in the beginning and 406.9MB in the end (delta: -264.8MB). Peak memory consumption was 254.1MB. Max. memory is 8.0GB. [2023-12-19 10:49:08,856 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 10:49:08,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.32ms. Allocated memory is still 197.1MB. Free memory was 141.8MB in the beginning and 129.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 10:49:08,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.26ms. Allocated memory is still 197.1MB. Free memory was 129.2MB in the beginning and 126.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 10:49:08,856 INFO L158 Benchmark]: Boogie Preprocessor took 38.10ms. Allocated memory is still 197.1MB. Free memory was 126.8MB in the beginning and 124.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 10:49:08,856 INFO L158 Benchmark]: RCFGBuilder took 343.91ms. Allocated memory is still 197.1MB. Free memory was 124.7MB in the beginning and 107.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-19 10:49:08,857 INFO L158 Benchmark]: TraceAbstraction took 24541.10ms. Allocated memory was 197.1MB in the beginning and 715.1MB in the end (delta: 518.0MB). Free memory was 106.5MB in the beginning and 406.9MB in the end (delta: -300.4MB). Peak memory consumption was 218.4MB. Max. memory is 8.0GB. [2023-12-19 10:49:08,857 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.32ms. Allocated memory is still 197.1MB. Free memory was 141.8MB in the beginning and 129.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.26ms. Allocated memory is still 197.1MB. Free memory was 129.2MB in the beginning and 126.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.10ms. Allocated memory is still 197.1MB. Free memory was 126.8MB in the beginning and 124.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 343.91ms. Allocated memory is still 197.1MB. Free memory was 124.7MB in the beginning and 107.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 24541.10ms. Allocated memory was 197.1MB in the beginning and 715.1MB in the end (delta: 518.0MB). Free memory was 106.5MB in the beginning and 406.9MB in the end (delta: -300.4MB). Peak memory consumption was 218.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] signed short int var_1_2 = 0; [L24] signed short int var_1_3 = 1000; [L25] signed short int var_1_4 = 10; [L26] signed short int var_1_5 = 32; [L27] signed long int var_1_6 = 5; [L28] signed long int var_1_7 = 1; [L29] signed long int var_1_8 = 7; [L30] signed long int var_1_9 = 1; [L31] signed long int var_1_10 = 32; [L32] unsigned char var_1_11 = 64; [L33] signed long int var_1_12 = 1230482582; [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] FCALL updateLastVariables() [L100] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_short() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L62] CALL assume_abort_if_not(var_1_2 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L62] RET assume_abort_if_not(var_1_2 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L63] var_1_3 = __VERIFIER_nondet_short() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L65] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L65] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L66] var_1_4 = __VERIFIER_nondet_short() [L67] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L67] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L68] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L68] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L69] var_1_5 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L71] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L71] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L72] var_1_7 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=7, var_1_9=1] [L73] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=7, var_1_9=1] [L74] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=7, var_1_9=1] [L74] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=7, var_1_9=1] [L75] var_1_8 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=1] [L76] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=1] [L77] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=1] [L78] var_1_9 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L79] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L80] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L80] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L81] var_1_11 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L82] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L83] CALL assume_abort_if_not(var_1_11 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L83] RET assume_abort_if_not(var_1_11 <= 255) VAL [isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L84] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L84] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1230482582, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L85] var_1_12 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L86] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L87] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L87] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L100] RET updateVariables() [L101] CALL step() [L37] var_1_1 = ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=16396, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=5, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L38] COND FALSE !(var_1_2 >= var_1_1) [L45] var_1_6 = var_1_4 VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=16396, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=2, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L47] EXPR var_1_4 << var_1_2 VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=16396, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=2, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L47] signed long int stepLocal_1 = var_1_6 + (var_1_4 << var_1_2); [L48] signed long int stepLocal_0 = var_1_2 - (var_1_12 - var_1_5); VAL [isInitial=1, stepLocal_0=-1073709057, stepLocal_1=16383, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=16396, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=2, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L49] COND FALSE !(stepLocal_1 != var_1_5) [L56] var_1_10 = var_1_2 VAL [isInitial=1, stepLocal_0=-1073709057, stepLocal_1=16383, var_1_10=16383, var_1_11=2, var_1_12=1073741823, var_1_1=16396, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=2, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) VAL [isInitial=1, var_1_10=16383, var_1_11=2, var_1_12=1073741823, var_1_1=16396, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=2, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L92] EXPR var_1_4 << var_1_2 VAL [isInitial=1, var_1_10=16383, var_1_11=2, var_1_12=1073741823, var_1_1=16396, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=2, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L92] EXPR ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) VAL [isInitial=1, var_1_10=16383, var_1_11=2, var_1_12=1073741823, var_1_1=16396, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=2, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L92-L93] return ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=16383, var_1_11=2, var_1_12=1073741823, var_1_1=16396, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=2, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=16383, var_1_11=2, var_1_12=1073741823, var_1_1=16396, var_1_2=16383, var_1_3=1, var_1_4=2, var_1_5=16383, var_1_6=2, var_1_7=-2147483648, var_1_8=2147483647, var_1_9=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.4s, OverallIterations: 8, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 205 SdHoareTripleChecker+Valid, 9.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 1385 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 935 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 639 IncrementalHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 450 mSDtfsCounter, 639 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 680 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=6, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 84 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 930 NumberOfCodeBlocks, 930 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 922 ConstructedInterpolants, 0 QuantifiedInterpolants, 8297 SizeOfPredicates, 20 NumberOfNonLiveVariables, 810 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 5460/5472 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-19 10:49:08,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...