/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_fillercode_fillercodestructure_filler-pe-ci_file-9.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:09:55,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:09:55,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 20:09:55,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:09:55,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:09:55,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:09:55,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:09:55,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:09:55,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:09:55,299 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:09:55,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:09:55,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:09:55,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:09:55,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:09:55,300 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:09:55,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:09:55,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:09:55,301 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:09:55,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:09:55,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:09:55,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:09:55,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:09:55,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:09:55,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:09:55,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:09:55,302 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:09:55,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:09:55,303 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:09:55,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:09:55,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:09:55,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:09:55,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:09:55,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:09:55,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:09:55,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:09:55,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:09:55,305 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:09:55,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:09:55,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:09:55,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:09:55,305 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:09:55,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:09:55,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:09:55,306 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 20:09:55,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:09:55,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:09:55,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:09:55,516 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:09:55,516 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:09:55,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i [2023-12-15 20:09:56,426 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:09:56,583 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:09:56,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i [2023-12-15 20:09:56,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d590115/9d0cc87b9b0d4c689a7be25809e2c122/FLAG87dce1b38 [2023-12-15 20:09:56,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d590115/9d0cc87b9b0d4c689a7be25809e2c122 [2023-12-15 20:09:56,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:09:56,602 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:09:56,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:09:56,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:09:56,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:09:56,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:09:56" (1/1) ... [2023-12-15 20:09:56,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5563e82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:09:56, skipping insertion in model container [2023-12-15 20:09:56,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:09:56" (1/1) ... [2023-12-15 20:09:56,631 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:09:56,728 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i[918,931] [2023-12-15 20:09:56,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:09:56,782 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:09:56,795 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i[918,931] [2023-12-15 20:09:56,815 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:09:56,827 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:09:56,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:09:56 WrapperNode [2023-12-15 20:09:56,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:09:56,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:09:56,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:09:56,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:09:56,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:09:56" (1/1) ... [2023-12-15 20:09:56,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:09:56" (1/1) ... [2023-12-15 20:09:56,870 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2023-12-15 20:09:56,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:09:56,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:09:56,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:09:56,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:09:56,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:09:56" (1/1) ... [2023-12-15 20:09:56,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:09:56" (1/1) ... [2023-12-15 20:09:56,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:09:56" (1/1) ... [2023-12-15 20:09:56,899 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-15 20:09:56,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:09:56" (1/1) ... [2023-12-15 20:09:56,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:09:56" (1/1) ... [2023-12-15 20:09:56,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:09:56" (1/1) ... [2023-12-15 20:09:56,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:09:56" (1/1) ... [2023-12-15 20:09:56,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:09:56" (1/1) ... [2023-12-15 20:09:56,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:09:56" (1/1) ... [2023-12-15 20:09:56,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:09:56,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:09:56,931 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:09:56,931 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:09:56,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:09:56" (1/1) ... [2023-12-15 20:09:56,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:09:56,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:09:56,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 20:09:56,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 20:09:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:09:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:09:56,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:09:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:09:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:09:56,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:09:57,063 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:09:57,066 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:09:57,367 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:09:57,398 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:09:57,398 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:09:57,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:09:57 BoogieIcfgContainer [2023-12-15 20:09:57,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:09:57,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:09:57,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:09:57,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:09:57,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:09:56" (1/3) ... [2023-12-15 20:09:57,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbf57e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:09:57, skipping insertion in model container [2023-12-15 20:09:57,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:09:56" (2/3) ... [2023-12-15 20:09:57,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbf57e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:09:57, skipping insertion in model container [2023-12-15 20:09:57,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:09:57" (3/3) ... [2023-12-15 20:09:57,404 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i [2023-12-15 20:09:57,415 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:09:57,416 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:09:57,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:09:57,475 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;@8ac8d65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:09:57,475 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:09:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 63 states have internal predecessors, (100), 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-15 20:09:57,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-15 20:09:57,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:09:57,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:09:57,491 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:09:57,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:09:57,495 INFO L85 PathProgramCache]: Analyzing trace with hash -218736605, now seen corresponding path program 1 times [2023-12-15 20:09:57,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:09:57,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445126550] [2023-12-15 20:09:57,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:09:57,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:09:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:09:57,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:09:57,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445126550] [2023-12-15 20:09:57,647 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-15 20:09:57,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342682593] [2023-12-15 20:09:57,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:09:57,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:09:57,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:09:57,651 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:09:57,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 20:09:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:09:57,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-15 20:09:57,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:09:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2023-12-15 20:09:57,845 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:09:57,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342682593] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:09:57,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:09:57,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:09:57,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145051596] [2023-12-15 20:09:57,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:09:57,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:09:57,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:09:57,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:09:57,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:09:57,883 INFO L87 Difference]: Start difference. First operand has 84 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 63 states have internal predecessors, (100), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (19), 2 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-15 20:09:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:09:57,921 INFO L93 Difference]: Finished difference Result 165 states and 293 transitions. [2023-12-15 20:09:57,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:09:57,923 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (19), 2 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 133 [2023-12-15 20:09:57,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:09:57,928 INFO L225 Difference]: With dead ends: 165 [2023-12-15 20:09:57,928 INFO L226 Difference]: Without dead ends: 82 [2023-12-15 20:09:57,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:09:57,933 INFO L413 NwaCegarLoop]: 129 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, 129 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-15 20:09:57,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:09:57,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-15 20:09:57,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-12-15 20:09:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.540983606557377) internal successors, (94), 61 states have internal predecessors, (94), 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-15 20:09:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 132 transitions. [2023-12-15 20:09:57,967 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 132 transitions. Word has length 133 [2023-12-15 20:09:57,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:09:57,968 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 132 transitions. [2023-12-15 20:09:57,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (19), 2 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-15 20:09:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 132 transitions. [2023-12-15 20:09:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-15 20:09:57,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:09:57,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:09:57,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 20:09:58,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-15 20:09:58,180 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:09:58,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:09:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1861973795, now seen corresponding path program 1 times [2023-12-15 20:09:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:09:58,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277481134] [2023-12-15 20:09:58,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:09:58,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:09:58,235 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:09:58,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1285724461] [2023-12-15 20:09:58,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:09:58,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:09:58,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:09:58,237 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:09:58,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 20:09:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:09:58,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 20:09:58,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:09:58,389 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-15 20:09:58,389 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:09:58,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:09:58,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277481134] [2023-12-15 20:09:58,390 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:09:58,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285724461] [2023-12-15 20:09:58,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285724461] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:09:58,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:09:58,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:09:58,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587478676] [2023-12-15 20:09:58,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:09:58,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:09:58,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:09:58,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:09:58,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:09:58,392 INFO L87 Difference]: Start difference. First operand 82 states and 132 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-15 20:09:58,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:09:58,434 INFO L93 Difference]: Finished difference Result 164 states and 265 transitions. [2023-12-15 20:09:58,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:09:58,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 133 [2023-12-15 20:09:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:09:58,439 INFO L225 Difference]: With dead ends: 164 [2023-12-15 20:09:58,439 INFO L226 Difference]: Without dead ends: 83 [2023-12-15 20:09:58,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 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-15 20:09:58,440 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:09:58,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:09:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-15 20:09:58,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-12-15 20:09:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.532258064516129) internal successors, (95), 62 states have internal predecessors, (95), 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-15 20:09:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2023-12-15 20:09:58,448 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 133 transitions. Word has length 133 [2023-12-15 20:09:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:09:58,449 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 133 transitions. [2023-12-15 20:09:58,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-15 20:09:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 133 transitions. [2023-12-15 20:09:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-15 20:09:58,451 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:09:58,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:09:58,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 20:09:58,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-15 20:09:58,660 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:09:58,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:09:58,660 INFO L85 PathProgramCache]: Analyzing trace with hash 627555167, now seen corresponding path program 1 times [2023-12-15 20:09:58,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:09:58,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551882745] [2023-12-15 20:09:58,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:09:58,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:09:58,697 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:09:58,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1069743613] [2023-12-15 20:09:58,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:09:58,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:09:58,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:09:58,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:09:58,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 20:09:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:09:58,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 20:09:58,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:09:58,850 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-15 20:09:58,851 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:09:58,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:09:58,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551882745] [2023-12-15 20:09:58,851 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:09:58,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069743613] [2023-12-15 20:09:58,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069743613] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:09:58,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:09:58,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:09:58,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457360759] [2023-12-15 20:09:58,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:09:58,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:09:58,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:09:58,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:09:58,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:09:58,854 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-15 20:09:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:09:58,914 INFO L93 Difference]: Finished difference Result 225 states and 359 transitions. [2023-12-15 20:09:58,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:09:58,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 133 [2023-12-15 20:09:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:09:58,920 INFO L225 Difference]: With dead ends: 225 [2023-12-15 20:09:58,921 INFO L226 Difference]: Without dead ends: 143 [2023-12-15 20:09:58,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 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-15 20:09:58,925 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 89 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:09:58,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 263 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:09:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-12-15 20:09:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2023-12-15 20:09:58,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 105 states have (on average 1.4952380952380953) internal successors, (157), 106 states have internal predecessors, (157), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-15 20:09:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 221 transitions. [2023-12-15 20:09:58,943 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 221 transitions. Word has length 133 [2023-12-15 20:09:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:09:58,945 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 221 transitions. [2023-12-15 20:09:58,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-15 20:09:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 221 transitions. [2023-12-15 20:09:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-15 20:09:58,952 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:09:58,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:09:58,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 20:09:59,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:09:59,159 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:09:59,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:09:59,159 INFO L85 PathProgramCache]: Analyzing trace with hash -652308511, now seen corresponding path program 1 times [2023-12-15 20:09:59,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:09:59,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497585955] [2023-12-15 20:09:59,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:09:59,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:09:59,182 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:09:59,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1704958373] [2023-12-15 20:09:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:09:59,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:09:59,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:09:59,184 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:09:59,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 20:09:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:09:59,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-15 20:09:59,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:09:59,522 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-15 20:09:59,522 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:09:59,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:09:59,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497585955] [2023-12-15 20:09:59,522 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:09:59,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704958373] [2023-12-15 20:09:59,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704958373] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:09:59,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:09:59,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:09:59,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025489581] [2023-12-15 20:09:59,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:09:59,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:09:59,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:09:59,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:09:59,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:09:59,525 INFO L87 Difference]: Start difference. First operand 140 states and 221 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-15 20:09:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:09:59,862 INFO L93 Difference]: Finished difference Result 473 states and 746 transitions. [2023-12-15 20:09:59,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 20:09:59,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 133 [2023-12-15 20:09:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:09:59,867 INFO L225 Difference]: With dead ends: 473 [2023-12-15 20:09:59,867 INFO L226 Difference]: Without dead ends: 334 [2023-12-15 20:09:59,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:09:59,868 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 214 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:09:59,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 555 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:09:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-12-15 20:09:59,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 302. [2023-12-15 20:09:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 255 states have (on average 1.5686274509803921) internal successors, (400), 258 states have internal predecessors, (400), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-15 20:09:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 484 transitions. [2023-12-15 20:09:59,887 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 484 transitions. Word has length 133 [2023-12-15 20:09:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:09:59,888 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 484 transitions. [2023-12-15 20:09:59,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-15 20:09:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 484 transitions. [2023-12-15 20:09:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-15 20:09:59,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:09:59,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:09:59,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 20:10:00,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:10:00,096 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:10:00,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:10:00,096 INFO L85 PathProgramCache]: Analyzing trace with hash -786322017, now seen corresponding path program 1 times [2023-12-15 20:10:00,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:10:00,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859587569] [2023-12-15 20:10:00,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:10:00,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:10:00,134 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:10:00,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139934730] [2023-12-15 20:10:00,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:10:00,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:10:00,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:10:00,136 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:10:00,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 20:10:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:10:00,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-15 20:10:00,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:10:00,387 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-15 20:10:00,388 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:10:00,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:10:00,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859587569] [2023-12-15 20:10:00,388 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:10:00,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139934730] [2023-12-15 20:10:00,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139934730] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:10:00,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:10:00,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:10:00,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960697438] [2023-12-15 20:10:00,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:10:00,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:10:00,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:10:00,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:10:00,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:10:00,390 INFO L87 Difference]: Start difference. First operand 302 states and 484 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-15 20:10:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:10:00,719 INFO L93 Difference]: Finished difference Result 639 states and 1013 transitions. [2023-12-15 20:10:00,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 20:10:00,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 133 [2023-12-15 20:10:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:10:00,722 INFO L225 Difference]: With dead ends: 639 [2023-12-15 20:10:00,722 INFO L226 Difference]: Without dead ends: 338 [2023-12-15 20:10:00,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:10:00,724 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 156 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:10:00,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 655 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:10:00,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-12-15 20:10:00,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 244. [2023-12-15 20:10:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 197 states have (on average 1.5228426395939085) internal successors, (300), 200 states have internal predecessors, (300), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-15 20:10:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 384 transitions. [2023-12-15 20:10:00,746 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 384 transitions. Word has length 133 [2023-12-15 20:10:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:10:00,746 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 384 transitions. [2023-12-15 20:10:00,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-15 20:10:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 384 transitions. [2023-12-15 20:10:00,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-15 20:10:00,747 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:10:00,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:10:00,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-15 20:10:00,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:10:00,957 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:10:00,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:10:00,958 INFO L85 PathProgramCache]: Analyzing trace with hash -590268897, now seen corresponding path program 1 times [2023-12-15 20:10:00,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:10:00,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509447998] [2023-12-15 20:10:00,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:10:00,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:10:00,977 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:10:00,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077558339] [2023-12-15 20:10:00,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:10:00,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:10:00,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:10:00,978 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:10:00,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-15 20:10:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:10:01,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 20:10:01,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:10:01,244 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-15 20:10:01,245 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:10:01,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:10:01,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509447998] [2023-12-15 20:10:01,245 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:10:01,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077558339] [2023-12-15 20:10:01,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077558339] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:10:01,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:10:01,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:10:01,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378518210] [2023-12-15 20:10:01,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:10:01,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:10:01,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:10:01,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:10:01,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:10:01,247 INFO L87 Difference]: Start difference. First operand 244 states and 384 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-15 20:10:01,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:10:01,559 INFO L93 Difference]: Finished difference Result 580 states and 912 transitions. [2023-12-15 20:10:01,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 20:10:01,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 133 [2023-12-15 20:10:01,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:10:01,561 INFO L225 Difference]: With dead ends: 580 [2023-12-15 20:10:01,561 INFO L226 Difference]: Without dead ends: 337 [2023-12-15 20:10:01,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:10:01,562 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 250 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:10:01,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 643 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:10:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-12-15 20:10:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 306. [2023-12-15 20:10:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 259 states have (on average 1.5598455598455598) internal successors, (404), 262 states have internal predecessors, (404), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-15 20:10:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 488 transitions. [2023-12-15 20:10:01,575 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 488 transitions. Word has length 133 [2023-12-15 20:10:01,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:10:01,575 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 488 transitions. [2023-12-15 20:10:01,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-15 20:10:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 488 transitions. [2023-12-15 20:10:01,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-15 20:10:01,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:10:01,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:10:01,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-15 20:10:01,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:10:01,783 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:10:01,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:10:01,784 INFO L85 PathProgramCache]: Analyzing trace with hash -724282403, now seen corresponding path program 1 times [2023-12-15 20:10:01,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:10:01,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968419740] [2023-12-15 20:10:01,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:10:01,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:10:01,813 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:10:01,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1964358936] [2023-12-15 20:10:01,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:10:01,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:10:01,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:10:01,819 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:10:01,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-15 20:10:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:10:01,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 20:10:01,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:10:02,087 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-15 20:10:02,088 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:10:02,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:10:02,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968419740] [2023-12-15 20:10:02,088 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:10:02,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964358936] [2023-12-15 20:10:02,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964358936] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:10:02,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:10:02,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:10:02,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547678907] [2023-12-15 20:10:02,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:10:02,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:10:02,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:10:02,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:10:02,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:10:02,090 INFO L87 Difference]: Start difference. First operand 306 states and 488 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-15 20:10:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:10:03,180 INFO L93 Difference]: Finished difference Result 646 states and 1020 transitions. [2023-12-15 20:10:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 20:10:03,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 133 [2023-12-15 20:10:03,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:10:03,182 INFO L225 Difference]: With dead ends: 646 [2023-12-15 20:10:03,182 INFO L226 Difference]: Without dead ends: 341 [2023-12-15 20:10:03,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:10:03,183 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 200 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:10:03,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 653 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 20:10:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-12-15 20:10:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 248. [2023-12-15 20:10:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 201 states have (on average 1.5124378109452736) internal successors, (304), 204 states have internal predecessors, (304), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-15 20:10:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 388 transitions. [2023-12-15 20:10:03,193 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 388 transitions. Word has length 133 [2023-12-15 20:10:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:10:03,193 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 388 transitions. [2023-12-15 20:10:03,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-15 20:10:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 388 transitions. [2023-12-15 20:10:03,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-15 20:10:03,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:10:03,194 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:10:03,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-15 20:10:03,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:10:03,400 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:10:03,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:10:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1646754170, now seen corresponding path program 1 times [2023-12-15 20:10:03,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:10:03,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793563475] [2023-12-15 20:10:03,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:10:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:10:03,425 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:10:03,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [246339097] [2023-12-15 20:10:03,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:10:03,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:10:03,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:10:03,431 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:10:03,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-15 20:10:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:10:03,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-15 20:10:03,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:10:03,578 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-15 20:10:03,579 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:10:03,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:10:03,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793563475] [2023-12-15 20:10:03,579 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:10:03,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246339097] [2023-12-15 20:10:03,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246339097] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:10:03,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:10:03,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 20:10:03,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956733736] [2023-12-15 20:10:03,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:10:03,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:10:03,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:10:03,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:10:03,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:10:03,580 INFO L87 Difference]: Start difference. First operand 248 states and 388 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-15 20:10:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:10:04,566 INFO L93 Difference]: Finished difference Result 753 states and 1172 transitions. [2023-12-15 20:10:04,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 20:10:04,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 135 [2023-12-15 20:10:04,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:10:04,568 INFO L225 Difference]: With dead ends: 753 [2023-12-15 20:10:04,568 INFO L226 Difference]: Without dead ends: 506 [2023-12-15 20:10:04,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:10:04,569 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 128 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 20:10:04,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 552 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-15 20:10:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2023-12-15 20:10:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 406. [2023-12-15 20:10:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 347 states have (on average 1.5100864553314122) internal successors, (524), 354 states have internal predecessors, (524), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 43 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-15 20:10:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 624 transitions. [2023-12-15 20:10:04,582 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 624 transitions. Word has length 135 [2023-12-15 20:10:04,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:10:04,582 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 624 transitions. [2023-12-15 20:10:04,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-15 20:10:04,582 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 624 transitions. [2023-12-15 20:10:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-15 20:10:04,583 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:10:04,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:10:04,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-15 20:10:04,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-15 20:10:04,784 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:10:04,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:10:04,785 INFO L85 PathProgramCache]: Analyzing trace with hash -130382586, now seen corresponding path program 1 times [2023-12-15 20:10:04,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:10:04,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981055923] [2023-12-15 20:10:04,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:10:04,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:10:04,814 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:10:04,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1041411915] [2023-12-15 20:10:04,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:10:04,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:10:04,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:10:04,822 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:10:04,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-15 20:10:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:10:04,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 20:10:04,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:10:04,919 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-15 20:10:04,919 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:10:04,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:10:04,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981055923] [2023-12-15 20:10:04,919 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:10:04,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041411915] [2023-12-15 20:10:04,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041411915] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:10:04,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:10:04,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:10:04,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631714654] [2023-12-15 20:10:04,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:10:04,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:10:04,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:10:04,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:10:04,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:10:04,922 INFO L87 Difference]: Start difference. First operand 406 states and 624 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-15 20:10:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:10:04,989 INFO L93 Difference]: Finished difference Result 1210 states and 1860 transitions. [2023-12-15 20:10:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:10:04,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 135 [2023-12-15 20:10:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:10:04,992 INFO L225 Difference]: With dead ends: 1210 [2023-12-15 20:10:04,993 INFO L226 Difference]: Without dead ends: 805 [2023-12-15 20:10:04,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 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-15 20:10:04,995 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 107 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:10:04,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 231 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:10:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2023-12-15 20:10:05,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 658. [2023-12-15 20:10:05,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 599 states have (on average 1.5525876460767947) internal successors, (930), 606 states have internal predecessors, (930), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 43 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-15 20:10:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1030 transitions. [2023-12-15 20:10:05,023 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1030 transitions. Word has length 135 [2023-12-15 20:10:05,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:10:05,025 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 1030 transitions. [2023-12-15 20:10:05,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-15 20:10:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1030 transitions. [2023-12-15 20:10:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-15 20:10:05,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:10:05,027 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:10:05,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-15 20:10:05,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:10:05,233 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:10:05,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:10:05,233 INFO L85 PathProgramCache]: Analyzing trace with hash -128535544, now seen corresponding path program 1 times [2023-12-15 20:10:05,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:10:05,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770608846] [2023-12-15 20:10:05,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:10:05,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:10:05,249 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:10:05,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [799159118] [2023-12-15 20:10:05,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:10:05,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:10:05,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:10:05,250 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:10:05,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-15 20:10:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:10:05,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-15 20:10:05,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:10:05,486 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 288 proven. 39 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2023-12-15 20:10:05,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:10:10,442 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~var_1_6~0 c_~var_1_6~0))) (and (or (< .cse0 1) (< .cse0 c_~var_1_6~0)) (forall ((v_z_3 Int)) (or (= v_z_3 0) (< (div v_z_3 c_~var_1_6~0) v_z_3) (< 255 v_z_3) (< .cse0 v_z_3) (< v_z_3 0))))) is different from false [2023-12-15 20:10:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-12-15 20:10:10,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:10:10,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770608846] [2023-12-15 20:10:10,737 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:10:10,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799159118] [2023-12-15 20:10:10,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799159118] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:10:10,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 20:10:10,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2023-12-15 20:10:10,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268894443] [2023-12-15 20:10:10,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 20:10:10,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 20:10:10,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:10:10,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 20:10:10,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=91, Unknown=1, NotChecked=20, Total=156 [2023-12-15 20:10:10,738 INFO L87 Difference]: Start difference. First operand 658 states and 1030 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2023-12-15 20:10:20,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:10:20,506 INFO L93 Difference]: Finished difference Result 2653 states and 4019 transitions. [2023-12-15 20:10:20,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-15 20:10:20,506 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 135 [2023-12-15 20:10:20,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:10:20,512 INFO L225 Difference]: With dead ends: 2653 [2023-12-15 20:10:20,513 INFO L226 Difference]: Without dead ends: 1996 [2023-12-15 20:10:20,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=224, Invalid=429, Unknown=1, NotChecked=48, Total=702 [2023-12-15 20:10:20,514 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 527 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 420 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:10:20,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 372 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 542 Invalid, 0 Unknown, 420 Unchecked, 1.2s Time] [2023-12-15 20:10:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2023-12-15 20:10:20,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 628. [2023-12-15 20:10:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 567 states have (on average 1.5149911816578483) internal successors, (859), 574 states have internal predecessors, (859), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 43 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-15 20:10:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 959 transitions. [2023-12-15 20:10:20,567 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 959 transitions. Word has length 135 [2023-12-15 20:10:20,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:10:20,567 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 959 transitions. [2023-12-15 20:10:20,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2023-12-15 20:10:20,567 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 959 transitions. [2023-12-15 20:10:20,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-15 20:10:20,568 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:10:20,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:10:20,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-15 20:10:20,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-15 20:10:20,774 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:10:20,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:10:20,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1139652794, now seen corresponding path program 1 times [2023-12-15 20:10:20,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:10:20,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451166973] [2023-12-15 20:10:20,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:10:20,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:10:20,787 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:10:20,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [198634469] [2023-12-15 20:10:20,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:10:20,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:10:20,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:10:20,788 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:10:20,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-15 20:10:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:10:20,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 20:10:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:10:21,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 20:10:21,024 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 20:10:21,025 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:10:21,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-15 20:10:21,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-15 20:10:21,235 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:10:21,237 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:10:21,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:10:21 BoogieIcfgContainer [2023-12-15 20:10:21,328 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:10:21,328 INFO L158 Benchmark]: Toolchain (without parser) took 24726.60ms. Allocated memory was 190.8MB in the beginning and 331.4MB in the end (delta: 140.5MB). Free memory was 137.4MB in the beginning and 242.9MB in the end (delta: -105.6MB). Peak memory consumption was 37.2MB. Max. memory is 8.0GB. [2023-12-15 20:10:21,329 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory is still 137.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:10:21,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.64ms. Allocated memory is still 190.8MB. Free memory was 137.4MB in the beginning and 122.5MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 20:10:21,329 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.43ms. Allocated memory is still 190.8MB. Free memory was 122.5MB in the beginning and 118.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 20:10:21,329 INFO L158 Benchmark]: Boogie Preprocessor took 59.54ms. Allocated memory is still 190.8MB. Free memory was 118.9MB in the beginning and 115.1MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:10:21,329 INFO L158 Benchmark]: RCFGBuilder took 467.85ms. Allocated memory is still 190.8MB. Free memory was 114.7MB in the beginning and 87.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-12-15 20:10:21,330 INFO L158 Benchmark]: TraceAbstraction took 23928.04ms. Allocated memory was 190.8MB in the beginning and 331.4MB in the end (delta: 140.5MB). Free memory was 87.0MB in the beginning and 242.9MB in the end (delta: -155.9MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:10:21,331 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 190.8MB. Free memory is still 137.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.64ms. Allocated memory is still 190.8MB. Free memory was 137.4MB in the beginning and 122.5MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.43ms. Allocated memory is still 190.8MB. Free memory was 122.5MB in the beginning and 118.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.54ms. Allocated memory is still 190.8MB. Free memory was 118.9MB in the beginning and 115.1MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 467.85ms. Allocated memory is still 190.8MB. Free memory was 114.7MB in the beginning and 87.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 23928.04ms. Allocated memory was 190.8MB in the beginning and 331.4MB in the end (delta: 140.5MB). Free memory was 87.0MB in the beginning and 242.9MB in the end (delta: -155.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 161, overapproximation of shiftLeft at line 169, overapproximation of someUnaryDOUBLEoperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 169. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_23 = 64; [L38] unsigned short int var_1_26 = 32; [L39] unsigned short int var_1_28 = 64; [L40] float var_1_30 = -0.2; [L41] float var_1_32 = -0.375; [L42] float var_1_33 = 1.4; [L43] float var_1_35 = 1.5; [L44] unsigned char last_1_var_1_10 = 32; [L45] unsigned short int last_1_var_1_12 = 16; [L46] unsigned long int last_1_var_1_13 = 128; [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] CALL updateLastVariables() [L164] last_1_var_1_10 = var_1_10 [L165] last_1_var_1_12 = var_1_12 [L166] last_1_var_1_13 = var_1_13 [L176] RET updateLastVariables() [L177] CALL updateVariables() [L133] var_1_3 = __VERIFIER_nondet_short() [L134] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L134] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L135] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L135] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L136] var_1_5 = __VERIFIER_nondet_long() [L137] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L137] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L138] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L138] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L139] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L139] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L140] var_1_6 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L141] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L142] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L142] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L143] var_1_7 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L144] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L145] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L145] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L146] var_1_8 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_9=9/5] [L147] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_9=9/5] [L148] var_1_9 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L149] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L150] var_1_11 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L151] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L152] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L152] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L153] var_1_15 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L154] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L155] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L155] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L156] var_1_30 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L157] RET assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L158] CALL assume_abort_if_not(var_1_30 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L158] RET assume_abort_if_not(var_1_30 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L159] var_1_32 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L160] RET assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L161] CALL assume_abort_if_not(var_1_32 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L161] RET assume_abort_if_not(var_1_32 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L177] RET updateVariables() [L178] CALL step() [L50] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L51] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L53] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=8, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L54] COND TRUE var_1_6 <= stepLocal_2 [L55] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L59] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L59] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L66] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L68] var_1_18 = var_1_3 [L69] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L70] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L71] COND FALSE !((- var_1_9) <= var_1_8) [L84] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L86] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_2=16, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L87] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_2=16, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L87] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L88] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_0=8, stepLocal_1=0, stepLocal_2=16, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L95] COND FALSE !(var_1_15 || var_1_15) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_0=8, stepLocal_1=0, stepLocal_2=16, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L98] COND FALSE !(((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) == (~ 16u)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_0=8, stepLocal_1=0, stepLocal_2=16, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L103] COND TRUE var_1_11 <= var_1_12 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_0=8, stepLocal_1=0, stepLocal_2=16, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L104] COND FALSE !(var_1_11 <= (((((var_1_11) < (var_1_6)) ? (var_1_11) : (var_1_6))) / var_1_6)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_0=8, stepLocal_1=0, stepLocal_2=16, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L118] COND FALSE !((var_1_9 / var_1_30) > ((((var_1_8 / var_1_32) < 0 ) ? -(var_1_8 / var_1_32) : (var_1_8 / var_1_32)))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_0=8, stepLocal_1=0, stepLocal_2=16, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L123] var_1_33 = var_1_8 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_0=8, stepLocal_1=0, stepLocal_2=16, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=2] [L124] COND FALSE !(((256 - var_1_11) <= (var_1_11 + var_1_10)) || var_1_15) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_0=8, stepLocal_1=0, stepLocal_2=16, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=2] [L178] RET step() [L179] CALL, EXPR property() [L169] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=2] [L169] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=2] [L169] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=2] [L169] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=2] [L169] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=2] [L169-L170] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=2] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.8s, OverallIterations: 11, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1686 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1671 mSDsluCounter, 4304 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 420 IncrementalHoareTripleChecker+Unchecked, 2962 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2314 IncrementalHoareTripleChecker+Invalid, 2830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 1342 mSDtfsCounter, 2314 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1495 GetRequests, 1424 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=9, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1868 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1604 NumberOfCodeBlocks, 1604 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1460 ConstructedInterpolants, 1 QuantifiedInterpolants, 4082 SizeOfPredicates, 50 NumberOfNonLiveVariables, 3285 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 7446/7524 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-15 20:10:21,547 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-15 20:10:21,566 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 137 Received shutdown request...