/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-42.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 21:49:29,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 21:49:30,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 21:49:30,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 21:49:30,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 21:49:30,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 21:49:30,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 21:49:30,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 21:49:30,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 21:49:30,081 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 21:49:30,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 21:49:30,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 21:49:30,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 21:49:30,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 21:49:30,083 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 21:49:30,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 21:49:30,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 21:49:30,084 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 21:49:30,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 21:49:30,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 21:49:30,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 21:49:30,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 21:49:30,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 21:49:30,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 21:49:30,085 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 21:49:30,085 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 21:49:30,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 21:49:30,086 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 21:49:30,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 21:49:30,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 21:49:30,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 21:49:30,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 21:49:30,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 21:49:30,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 21:49:30,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 21:49:30,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 21:49:30,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 21:49:30,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 21:49:30,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 21:49:30,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 21:49:30,089 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 21:49:30,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 21:49:30,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 21:49:30,091 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 21:49:30,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 21:49:30,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 21:49:30,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 21:49:30,285 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 21:49:30,285 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 21:49:30,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-42.i [2023-12-20 21:49:31,300 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 21:49:31,485 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 21:49:31,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-42.i [2023-12-20 21:49:31,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd257bb71/3d1cba9975134f76910b0747de02097b/FLAGfd860f079 [2023-12-20 21:49:31,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd257bb71/3d1cba9975134f76910b0747de02097b [2023-12-20 21:49:31,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 21:49:31,511 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 21:49:31,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 21:49:31,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 21:49:31,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 21:49:31,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 09:49:31" (1/1) ... [2023-12-20 21:49:31,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad2d6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:31, skipping insertion in model container [2023-12-20 21:49:31,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 09:49:31" (1/1) ... [2023-12-20 21:49:31,544 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 21:49:31,633 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_normal_file-42.i[913,926] [2023-12-20 21:49:31,671 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 21:49:31,683 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 21:49:31,691 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_normal_file-42.i[913,926] [2023-12-20 21:49:31,731 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 21:49:31,742 INFO L206 MainTranslator]: Completed translation [2023-12-20 21:49:31,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:31 WrapperNode [2023-12-20 21:49:31,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 21:49:31,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 21:49:31,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 21:49:31,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 21:49:31,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:31" (1/1) ... [2023-12-20 21:49:31,754 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:31" (1/1) ... [2023-12-20 21:49:31,781 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2023-12-20 21:49:31,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 21:49:31,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 21:49:31,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 21:49:31,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 21:49:31,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:31" (1/1) ... [2023-12-20 21:49:31,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:31" (1/1) ... [2023-12-20 21:49:31,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:31" (1/1) ... [2023-12-20 21:49:31,816 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 21:49:31,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:31" (1/1) ... [2023-12-20 21:49:31,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:31" (1/1) ... [2023-12-20 21:49:31,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:31" (1/1) ... [2023-12-20 21:49:31,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:31" (1/1) ... [2023-12-20 21:49:31,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:31" (1/1) ... [2023-12-20 21:49:31,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:31" (1/1) ... [2023-12-20 21:49:31,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 21:49:31,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 21:49:31,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 21:49:31,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 21:49:31,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:31" (1/1) ... [2023-12-20 21:49:31,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 21:49:31,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:49:31,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 21:49:31,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 21:49:31,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 21:49:31,953 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 21:49:31,953 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 21:49:31,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 21:49:31,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 21:49:31,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 21:49:32,005 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 21:49:32,007 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 21:49:32,223 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 21:49:32,273 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 21:49:32,274 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 21:49:32,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 09:49:32 BoogieIcfgContainer [2023-12-20 21:49:32,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 21:49:32,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 21:49:32,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 21:49:32,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 21:49:32,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 09:49:31" (1/3) ... [2023-12-20 21:49:32,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ceab4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 09:49:32, skipping insertion in model container [2023-12-20 21:49:32,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:49:31" (2/3) ... [2023-12-20 21:49:32,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ceab4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 09:49:32, skipping insertion in model container [2023-12-20 21:49:32,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 09:49:32" (3/3) ... [2023-12-20 21:49:32,283 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-42.i [2023-12-20 21:49:32,295 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 21:49:32,295 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 21:49:32,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 21:49:32,335 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;@494d1d66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 21:49:32,335 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 21:49:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-20 21:49:32,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-20 21:49:32,346 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:49:32,347 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:49:32,347 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:49:32,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:49:32,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1441148856, now seen corresponding path program 1 times [2023-12-20 21:49:32,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:49:32,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655427010] [2023-12-20 21:49:32,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:32,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:49:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:32,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:49:32,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655427010] [2023-12-20 21:49:32,512 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-20 21:49:32,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084410846] [2023-12-20 21:49:32,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:32,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:49:32,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:49:32,515 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 21:49:32,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 21:49:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:32,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-20 21:49:32,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:49:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2023-12-20 21:49:32,667 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 21:49:32,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084410846] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:49:32,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:49:32,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 21:49:32,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570224792] [2023-12-20 21:49:32,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:49:32,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 21:49:32,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:49:32,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 21:49:32,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 21:49:32,693 INFO L87 Difference]: Start difference. First operand has 47 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-20 21:49:32,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:49:32,732 INFO L93 Difference]: Finished difference Result 91 states and 154 transitions. [2023-12-20 21:49:32,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 21:49:32,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2023-12-20 21:49:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:49:32,740 INFO L225 Difference]: With dead ends: 91 [2023-12-20 21:49:32,740 INFO L226 Difference]: Without dead ends: 45 [2023-12-20 21:49:32,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 21:49:32,748 INFO L413 NwaCegarLoop]: 64 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, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 21:49:32,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 21:49:32,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-20 21:49:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-20 21:49:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-20 21:49:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2023-12-20 21:49:32,782 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 83 [2023-12-20 21:49:32,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:49:32,783 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2023-12-20 21:49:32,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-20 21:49:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2023-12-20 21:49:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-20 21:49:32,785 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:49:32,785 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:49:32,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 21:49:32,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-20 21:49:32,991 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:49:32,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:49:32,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2116648844, now seen corresponding path program 1 times [2023-12-20 21:49:32,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:49:32,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887646674] [2023-12-20 21:49:32,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:32,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:49:33,022 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 21:49:33,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1216298419] [2023-12-20 21:49:33,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:33,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:49:33,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:49:33,024 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 21:49:33,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 21:49:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:33,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 21:49:33,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:49:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-20 21:49:33,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 21:49:33,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:49:33,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887646674] [2023-12-20 21:49:33,170 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 21:49:33,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216298419] [2023-12-20 21:49:33,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216298419] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:49:33,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:49:33,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 21:49:33,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524701680] [2023-12-20 21:49:33,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:49:33,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 21:49:33,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:49:33,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 21:49:33,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 21:49:33,173 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-20 21:49:33,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:49:33,203 INFO L93 Difference]: Finished difference Result 89 states and 133 transitions. [2023-12-20 21:49:33,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 21:49:33,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2023-12-20 21:49:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:49:33,205 INFO L225 Difference]: With dead ends: 89 [2023-12-20 21:49:33,205 INFO L226 Difference]: Without dead ends: 45 [2023-12-20 21:49:33,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 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-20 21:49:33,208 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 11 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 21:49:33,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 105 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 21:49:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-20 21:49:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-20 21:49:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-20 21:49:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2023-12-20 21:49:33,228 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 83 [2023-12-20 21:49:33,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:49:33,229 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2023-12-20 21:49:33,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-20 21:49:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2023-12-20 21:49:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-20 21:49:33,231 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:49:33,231 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:49:33,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-20 21:49:33,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-20 21:49:33,437 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:49:33,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:49:33,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1307302218, now seen corresponding path program 1 times [2023-12-20 21:49:33,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:49:33,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539967015] [2023-12-20 21:49:33,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:33,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:49:33,485 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 21:49:33,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122872737] [2023-12-20 21:49:33,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:33,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:49:33,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:49:33,501 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 21:49:33,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 21:49:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:33,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-20 21:49:33,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:49:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-20 21:49:33,883 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 21:49:33,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:49:33,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539967015] [2023-12-20 21:49:33,884 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 21:49:33,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122872737] [2023-12-20 21:49:33,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122872737] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:49:33,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:49:33,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 21:49:33,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334160229] [2023-12-20 21:49:33,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:49:33,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 21:49:33,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:49:33,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 21:49:33,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 21:49:33,886 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-20 21:49:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:49:33,985 INFO L93 Difference]: Finished difference Result 134 states and 197 transitions. [2023-12-20 21:49:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 21:49:33,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2023-12-20 21:49:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:49:33,990 INFO L225 Difference]: With dead ends: 134 [2023-12-20 21:49:33,990 INFO L226 Difference]: Without dead ends: 90 [2023-12-20 21:49:33,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 21:49:33,995 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 85 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 21:49:33,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 196 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 21:49:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-20 21:49:34,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2023-12-20 21:49:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-20 21:49:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2023-12-20 21:49:34,014 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 83 [2023-12-20 21:49:34,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:49:34,014 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2023-12-20 21:49:34,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-20 21:49:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2023-12-20 21:49:34,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-20 21:49:34,015 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:49:34,015 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:49:34,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-20 21:49:34,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:49:34,231 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:49:34,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:49:34,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1204598053, now seen corresponding path program 1 times [2023-12-20 21:49:34,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:49:34,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843345230] [2023-12-20 21:49:34,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:34,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:49:34,265 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 21:49:34,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843431095] [2023-12-20 21:49:34,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:34,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:49:34,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:49:34,266 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 21:49:34,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-20 21:49:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:34,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-20 21:49:34,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:49:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-12-20 21:49:34,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 21:49:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2023-12-20 21:49:34,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:49:34,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843345230] [2023-12-20 21:49:34,688 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 21:49:34,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843431095] [2023-12-20 21:49:34,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843431095] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 21:49:34,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 21:49:34,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-20 21:49:34,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392178416] [2023-12-20 21:49:34,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 21:49:34,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 21:49:34,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:49:34,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 21:49:34,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-12-20 21:49:34,689 INFO L87 Difference]: Start difference. First operand 70 states and 102 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-20 21:49:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:49:35,230 INFO L93 Difference]: Finished difference Result 249 states and 335 transitions. [2023-12-20 21:49:35,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-20 21:49:35,231 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 84 [2023-12-20 21:49:35,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:49:35,233 INFO L225 Difference]: With dead ends: 249 [2023-12-20 21:49:35,233 INFO L226 Difference]: Without dead ends: 205 [2023-12-20 21:49:35,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=515, Invalid=1377, Unknown=0, NotChecked=0, Total=1892 [2023-12-20 21:49:35,234 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 319 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 21:49:35,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 353 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 21:49:35,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-12-20 21:49:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 135. [2023-12-20 21:49:35,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 89 states have internal predecessors, (109), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-20 21:49:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 181 transitions. [2023-12-20 21:49:35,251 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 181 transitions. Word has length 84 [2023-12-20 21:49:35,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:49:35,251 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 181 transitions. [2023-12-20 21:49:35,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-20 21:49:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 181 transitions. [2023-12-20 21:49:35,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-20 21:49:35,258 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:49:35,258 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:49:35,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-20 21:49:35,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:49:35,462 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:49:35,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:49:35,463 INFO L85 PathProgramCache]: Analyzing trace with hash 617792039, now seen corresponding path program 1 times [2023-12-20 21:49:35,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:49:35,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167339861] [2023-12-20 21:49:35,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:35,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:49:35,488 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 21:49:35,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073128126] [2023-12-20 21:49:35,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:35,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:49:35,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:49:35,489 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 21:49:35,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-20 21:49:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:35,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-20 21:49:35,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:49:35,757 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-20 21:49:35,758 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 21:49:35,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:49:35,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167339861] [2023-12-20 21:49:35,758 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 21:49:35,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073128126] [2023-12-20 21:49:35,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073128126] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:49:35,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:49:35,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 21:49:35,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513747330] [2023-12-20 21:49:35,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:49:35,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 21:49:35,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:49:35,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 21:49:35,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 21:49:35,769 INFO L87 Difference]: Start difference. First operand 135 states and 181 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-20 21:49:35,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:49:35,891 INFO L93 Difference]: Finished difference Result 329 states and 447 transitions. [2023-12-20 21:49:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 21:49:35,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2023-12-20 21:49:35,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:49:35,894 INFO L225 Difference]: With dead ends: 329 [2023-12-20 21:49:35,894 INFO L226 Difference]: Without dead ends: 228 [2023-12-20 21:49:35,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-20 21:49:35,896 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 90 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 21:49:35,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 228 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 21:49:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-12-20 21:49:35,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 195. [2023-12-20 21:49:35,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 134 states have internal predecessors, (168), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-20 21:49:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 264 transitions. [2023-12-20 21:49:35,933 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 264 transitions. Word has length 84 [2023-12-20 21:49:35,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:49:35,933 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 264 transitions. [2023-12-20 21:49:35,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-20 21:49:35,934 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 264 transitions. [2023-12-20 21:49:35,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-20 21:49:35,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:49:35,936 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:49:35,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-20 21:49:36,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:49:36,141 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:49:36,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:49:36,142 INFO L85 PathProgramCache]: Analyzing trace with hash -393325211, now seen corresponding path program 1 times [2023-12-20 21:49:36,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:49:36,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529994881] [2023-12-20 21:49:36,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:36,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:49:36,174 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 21:49:36,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [80955445] [2023-12-20 21:49:36,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:36,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:49:36,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:49:36,180 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 21:49:36,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-20 21:49:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:36,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-20 21:49:36,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:49:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 48 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-12-20 21:49:36,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 21:49:37,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:49:37,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529994881] [2023-12-20 21:49:37,362 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 21:49:37,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80955445] [2023-12-20 21:49:37,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80955445] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 21:49:37,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-20 21:49:37,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-12-20 21:49:37,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820809969] [2023-12-20 21:49:37,363 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-20 21:49:37,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 21:49:37,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:49:37,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 21:49:37,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2023-12-20 21:49:37,364 INFO L87 Difference]: Start difference. First operand 195 states and 264 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-20 21:49:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:49:39,705 INFO L93 Difference]: Finished difference Result 606 states and 791 transitions. [2023-12-20 21:49:39,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-20 21:49:39,706 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 84 [2023-12-20 21:49:39,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:49:39,708 INFO L225 Difference]: With dead ends: 606 [2023-12-20 21:49:39,708 INFO L226 Difference]: Without dead ends: 505 [2023-12-20 21:49:39,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=352, Invalid=770, Unknown=0, NotChecked=0, Total=1122 [2023-12-20 21:49:39,709 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 159 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-20 21:49:39,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 425 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-20 21:49:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2023-12-20 21:49:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 421. [2023-12-20 21:49:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 301 states have (on average 1.2458471760797343) internal successors, (375), 303 states have internal predecessors, (375), 88 states have call successors, (88), 31 states have call predecessors, (88), 31 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-20 21:49:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 551 transitions. [2023-12-20 21:49:39,735 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 551 transitions. Word has length 84 [2023-12-20 21:49:39,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:49:39,735 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 551 transitions. [2023-12-20 21:49:39,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-20 21:49:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 551 transitions. [2023-12-20 21:49:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-20 21:49:39,736 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:49:39,736 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:49:39,743 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-20 21:49:39,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:49:39,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:49:39,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:49:39,942 INFO L85 PathProgramCache]: Analyzing trace with hash -135159773, now seen corresponding path program 1 times [2023-12-20 21:49:39,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:49:39,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172012438] [2023-12-20 21:49:39,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:39,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:49:39,960 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 21:49:39,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [933087573] [2023-12-20 21:49:39,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:39,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:49:39,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:49:39,973 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-20 21:49:39,974 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-20 21:49:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:49:40,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-20 21:49:40,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:49:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-20 21:49:40,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 21:49:41,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:49:41,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172012438] [2023-12-20 21:49:41,471 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 21:49:41,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933087573] [2023-12-20 21:49:41,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933087573] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 21:49:41,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-20 21:49:41,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-12-20 21:49:41,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86065200] [2023-12-20 21:49:41,472 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-20 21:49:41,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-20 21:49:41,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:49:41,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-20 21:49:41,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-12-20 21:49:41,474 INFO L87 Difference]: Start difference. First operand 421 states and 551 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-20 21:49:42,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:49:42,630 INFO L93 Difference]: Finished difference Result 753 states and 986 transitions. [2023-12-20 21:49:42,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-20 21:49:42,630 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 84 [2023-12-20 21:49:42,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:49:42,633 INFO L225 Difference]: With dead ends: 753 [2023-12-20 21:49:42,633 INFO L226 Difference]: Without dead ends: 598 [2023-12-20 21:49:42,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2023-12-20 21:49:42,634 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 162 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 21:49:42,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 341 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 21:49:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2023-12-20 21:49:42,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 536. [2023-12-20 21:49:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 382 states have (on average 1.2356020942408377) internal successors, (472), 384 states have internal predecessors, (472), 112 states have call successors, (112), 41 states have call predecessors, (112), 41 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2023-12-20 21:49:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 696 transitions. [2023-12-20 21:49:42,664 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 696 transitions. Word has length 84 [2023-12-20 21:49:42,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:49:42,665 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 696 transitions. [2023-12-20 21:49:42,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-20 21:49:42,665 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 696 transitions. [2023-12-20 21:49:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-20 21:49:42,665 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:49:42,665 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:49:42,671 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-20 21:49:42,886 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-20 21:49:42,887 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:49:42,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:49:42,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1882768435, now seen corresponding path program 1 times [2023-12-20 21:49:42,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:49:42,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677243442] [2023-12-20 21:49:42,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:42,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:49:42,905 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 21:49:42,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1346799540] [2023-12-20 21:49:42,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:49:42,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:49:42,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:49:42,906 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-20 21:49:42,910 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-20 21:49:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 21:49:42,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 21:49:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 21:49:43,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 21:49:43,107 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 21:49:43,107 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 21:49:43,122 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-20 21:49:43,314 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-20 21:49:43,317 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:49:43,319 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 21:49:43,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 09:49:43 BoogieIcfgContainer [2023-12-20 21:49:43,396 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 21:49:43,396 INFO L158 Benchmark]: Toolchain (without parser) took 11885.03ms. Allocated memory was 250.6MB in the beginning and 310.4MB in the end (delta: 59.8MB). Free memory was 203.0MB in the beginning and 262.7MB in the end (delta: -59.7MB). Peak memory consumption was 170.6MB. Max. memory is 8.0GB. [2023-12-20 21:49:43,397 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 207.6MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 21:49:43,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.35ms. Allocated memory is still 250.6MB. Free memory was 202.7MB in the beginning and 189.0MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-20 21:49:43,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.29ms. Allocated memory is still 250.6MB. Free memory was 189.0MB in the beginning and 185.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-20 21:49:43,397 INFO L158 Benchmark]: Boogie Preprocessor took 61.40ms. Allocated memory is still 250.6MB. Free memory was 185.5MB in the beginning and 179.9MB in the end (delta: 5.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-20 21:49:43,397 INFO L158 Benchmark]: RCFGBuilder took 430.27ms. Allocated memory is still 250.6MB. Free memory was 179.9MB in the beginning and 211.5MB in the end (delta: -31.5MB). Peak memory consumption was 23.6MB. Max. memory is 8.0GB. [2023-12-20 21:49:43,397 INFO L158 Benchmark]: TraceAbstraction took 11120.50ms. Allocated memory was 250.6MB in the beginning and 310.4MB in the end (delta: 59.8MB). Free memory was 210.9MB in the beginning and 262.7MB in the end (delta: -51.7MB). Peak memory consumption was 177.4MB. Max. memory is 8.0GB. [2023-12-20 21:49:43,398 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.11ms. Allocated memory is still 207.6MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.35ms. Allocated memory is still 250.6MB. Free memory was 202.7MB in the beginning and 189.0MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.29ms. Allocated memory is still 250.6MB. Free memory was 189.0MB in the beginning and 185.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.40ms. Allocated memory is still 250.6MB. Free memory was 185.5MB in the beginning and 179.9MB in the end (delta: 5.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 430.27ms. Allocated memory is still 250.6MB. Free memory was 179.9MB in the beginning and 211.5MB in the end (delta: -31.5MB). Peak memory consumption was 23.6MB. Max. memory is 8.0GB. * TraceAbstraction took 11120.50ms. Allocated memory was 250.6MB in the beginning and 310.4MB in the end (delta: 59.8MB). Free memory was 210.9MB in the beginning and 262.7MB in the end (delta: -51.7MB). Peak memory consumption was 177.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] signed short int last_1_var_1_1 = 16; [L37] unsigned char last_1_var_1_6 = 10; [L38] unsigned char last_1_var_1_8 = 1; [L39] signed short int last_1_var_1_13 = 200; [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L117] last_1_var_1_1 = var_1_1 [L118] last_1_var_1_6 = var_1_6 [L119] last_1_var_1_8 = var_1_8 [L120] last_1_var_1_13 = var_1_13 [L130] RET updateLastVariables() [L131] CALL updateVariables() [L96] var_1_5 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L97] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L98] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L98] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L99] var_1_7 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L100] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L101] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L101] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L104] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L104] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L105] var_1_12 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L106] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L107] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L107] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L108] var_1_15 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L109] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L110] var_1_16 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L111] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L112] var_1_20 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L114] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L114] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L131] RET updateVariables() [L132] CALL step() [L43] signed long int stepLocal_6 = last_1_var_1_1; [L44] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L45] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L46] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L49] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L54] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L57] COND TRUE var_1_5 >= -2 [L58] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L60] unsigned char stepLocal_4 = var_1_6; [L61] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=101, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L62] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=101, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L63] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L64] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=101, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L71] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=101, stepLocal_5=1, stepLocal_6=16, stepLocal_7=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L72] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=101, stepLocal_5=1, stepLocal_6=16, stepLocal_7=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L75] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_3=0, stepLocal_4=101, stepLocal_5=1, stepLocal_6=16, stepLocal_7=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L76] COND TRUE \read(var_1_19) [L77] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_3=0, stepLocal_4=101, stepLocal_5=1, stepLocal_6=16, stepLocal_7=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L83] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L84] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, stepLocal_2=1, stepLocal_3=0, stepLocal_4=101, stepLocal_5=1, stepLocal_6=16, stepLocal_7=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L85] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L92] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, stepLocal_2=1, stepLocal_3=0, stepLocal_4=101, stepLocal_5=1, stepLocal_6=16, stepLocal_7=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=0] [L132] RET step() [L133] CALL, EXPR property() [L123-L124] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 8, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 834 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 826 mSDsluCounter, 1712 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1236 mSDsCounter, 260 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1106 IncrementalHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 260 mSolverCounterUnsat, 476 mSDtfsCounter, 1106 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 859 GetRequests, 748 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=536occurred in iteration=7, InterpolantAutomatonStates: 87, 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, 7 MinimizatonAttempts, 269 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 753 NumberOfCodeBlocks, 753 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 661 ConstructedInterpolants, 1 QuantifiedInterpolants, 3517 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1608 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 2016/2112 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-20 21:49:43,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...