./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-44.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-44.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9d7a0d6a4070f07d0273890c187a2843c127b373fc69a2a4cf38dcf6ecd96bde --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:14:29,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:14:29,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:14:29,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:14:29,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:14:29,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:14:29,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:14:29,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:14:29,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:14:29,499 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:14:29,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:14:29,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:14:29,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:14:29,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:14:29,504 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:14:29,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:14:29,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:14:29,505 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:14:29,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:14:29,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:14:29,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:14:29,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:14:29,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:14:29,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:14:29,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:14:29,511 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:14:29,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:14:29,512 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:14:29,512 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:14:29,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:14:29,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:14:29,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:14:29,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:14:29,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:14:29,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:14:29,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:14:29,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:14:29,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:14:29,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:14:29,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:14:29,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:14:29,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:14:29,517 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9d7a0d6a4070f07d0273890c187a2843c127b373fc69a2a4cf38dcf6ecd96bde [2024-11-10 07:14:29,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:14:29,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:14:29,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:14:29,793 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:14:29,793 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:14:29,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-44.i [2024-11-10 07:14:31,307 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:14:31,520 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:14:31,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-44.i [2024-11-10 07:14:31,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c27eacc6c/d4383db7009f43cfb2e1679b75e968fb/FLAGa98a4a5bb [2024-11-10 07:14:31,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c27eacc6c/d4383db7009f43cfb2e1679b75e968fb [2024-11-10 07:14:31,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:14:31,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:14:31,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:14:31,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:14:31,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:14:31,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:14:31" (1/1) ... [2024-11-10 07:14:31,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0b6623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:31, skipping insertion in model container [2024-11-10 07:14:31,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:14:31" (1/1) ... [2024-11-10 07:14:31,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:14:31,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-44.i[916,929] [2024-11-10 07:14:31,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:14:31,918 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:14:31,930 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-44.i[916,929] [2024-11-10 07:14:32,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:14:32,023 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:14:32,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:32 WrapperNode [2024-11-10 07:14:32,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:14:32,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:14:32,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:14:32,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:14:32,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:32" (1/1) ... [2024-11-10 07:14:32,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:32" (1/1) ... [2024-11-10 07:14:32,093 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 340 [2024-11-10 07:14:32,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:14:32,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:14:32,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:14:32,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:14:32,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:32" (1/1) ... [2024-11-10 07:14:32,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:32" (1/1) ... [2024-11-10 07:14:32,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:32" (1/1) ... [2024-11-10 07:14:32,143 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]. [2024-11-10 07:14:32,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:32" (1/1) ... [2024-11-10 07:14:32,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:32" (1/1) ... [2024-11-10 07:14:32,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:32" (1/1) ... [2024-11-10 07:14:32,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:32" (1/1) ... [2024-11-10 07:14:32,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:32" (1/1) ... [2024-11-10 07:14:32,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:32" (1/1) ... [2024-11-10 07:14:32,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:14:32,192 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:14:32,192 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:14:32,192 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:14:32,193 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:32" (1/1) ... [2024-11-10 07:14:32,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:14:32,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:14:32,240 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) [2024-11-10 07:14:32,244 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 [2024-11-10 07:14:32,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:14:32,292 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:14:32,293 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:14:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:14:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:14:32,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:14:32,417 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:14:32,419 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:14:32,927 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L190: havoc property_#t~ite34#1;havoc property_#t~bitwise30#1;havoc property_#t~ite33#1;havoc property_#t~ite32#1;havoc property_#t~bitwise31#1;havoc property_#t~short35#1;havoc property_#t~ite42#1;havoc property_#t~ite37#1;havoc property_#t~bitwise36#1;havoc property_#t~bitwise38#1;havoc property_#t~ite41#1;havoc property_#t~ite40#1;havoc property_#t~bitwise39#1;havoc property_#t~short43#1; [2024-11-10 07:14:32,987 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-10 07:14:32,987 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:14:33,026 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:14:33,026 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:14:33,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:14:33 BoogieIcfgContainer [2024-11-10 07:14:33,026 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:14:33,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:14:33,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:14:33,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:14:33,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:14:31" (1/3) ... [2024-11-10 07:14:33,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b38d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:14:33, skipping insertion in model container [2024-11-10 07:14:33,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:32" (2/3) ... [2024-11-10 07:14:33,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b38d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:14:33, skipping insertion in model container [2024-11-10 07:14:33,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:14:33" (3/3) ... [2024-11-10 07:14:33,037 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-44.i [2024-11-10 07:14:33,051 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:14:33,052 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:14:33,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:14:33,120 INFO L333 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, 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;@494c16a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:14:33,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:14:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 112 states have (on average 1.4107142857142858) internal successors, (158), 113 states have internal predecessors, (158), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 07:14:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-10 07:14:33,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:33,137 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:14:33,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:33,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:33,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1841543043, now seen corresponding path program 1 times [2024-11-10 07:14:33,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:33,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024639627] [2024-11-10 07:14:33,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:33,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:14:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:14:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:14:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:14:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:14:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:14:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:14:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:14:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:14:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:14:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:14:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:14:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:14:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:14:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:14:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:14:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:14:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:14:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:14:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:14:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:14:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:14:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:14:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:14:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:14:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:14:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:14:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:14:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 07:14:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 07:14:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 07:14:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-10 07:14:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-10 07:14:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 07:14:33,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:33,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024639627] [2024-11-10 07:14:33,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024639627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:14:33,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:14:33,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:14:33,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567138663] [2024-11-10 07:14:33,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:14:33,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:14:33,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:33,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:14:33,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:14:33,797 INFO L87 Difference]: Start difference. First operand has 148 states, 112 states have (on average 1.4107142857142858) internal successors, (158), 113 states have internal predecessors, (158), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 07:14:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:33,880 INFO L93 Difference]: Finished difference Result 283 states and 466 transitions. [2024-11-10 07:14:33,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:14:33,887 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 221 [2024-11-10 07:14:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:33,899 INFO L225 Difference]: With dead ends: 283 [2024-11-10 07:14:33,900 INFO L226 Difference]: Without dead ends: 138 [2024-11-10 07:14:33,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:14:33,913 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:33,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:14:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-10 07:14:33,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-10 07:14:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 103 states have (on average 1.3592233009708738) internal successors, (140), 103 states have internal predecessors, (140), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 07:14:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 206 transitions. [2024-11-10 07:14:33,984 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 206 transitions. Word has length 221 [2024-11-10 07:14:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:33,985 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 206 transitions. [2024-11-10 07:14:33,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 07:14:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 206 transitions. [2024-11-10 07:14:33,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-10 07:14:33,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:33,992 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:14:33,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:14:33,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:33,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:33,994 INFO L85 PathProgramCache]: Analyzing trace with hash 61544702, now seen corresponding path program 1 times [2024-11-10 07:14:33,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:33,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635208890] [2024-11-10 07:14:33,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:33,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:14:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:14:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:14:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:14:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:14:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:14:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:14:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:14:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:14:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:14:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:14:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:14:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:14:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:14:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:14:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:14:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:14:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:14:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:14:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:14:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:14:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:14:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:14:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:14:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:14:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:14:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:14:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:14:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 07:14:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 07:14:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 07:14:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-10 07:14:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-10 07:14:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 07:14:35,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:35,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635208890] [2024-11-10 07:14:35,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635208890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:14:35,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:14:35,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:14:35,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966255849] [2024-11-10 07:14:35,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:14:35,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:14:35,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:35,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:14:35,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:14:35,316 INFO L87 Difference]: Start difference. First operand 138 states and 206 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 07:14:35,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:35,683 INFO L93 Difference]: Finished difference Result 286 states and 425 transitions. [2024-11-10 07:14:35,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:14:35,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 221 [2024-11-10 07:14:35,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:35,687 INFO L225 Difference]: With dead ends: 286 [2024-11-10 07:14:35,689 INFO L226 Difference]: Without dead ends: 151 [2024-11-10 07:14:35,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:14:35,693 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 266 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:35,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 210 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:14:35,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-10 07:14:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2024-11-10 07:14:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 110 states have (on average 1.309090909090909) internal successors, (144), 111 states have internal predecessors, (144), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 07:14:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 218 transitions. [2024-11-10 07:14:35,724 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 218 transitions. Word has length 221 [2024-11-10 07:14:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:35,725 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 218 transitions. [2024-11-10 07:14:35,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 07:14:35,726 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 218 transitions. [2024-11-10 07:14:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-10 07:14:35,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:35,733 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:14:35,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:14:35,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:35,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:35,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1023158719, now seen corresponding path program 1 times [2024-11-10 07:14:35,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:35,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394838753] [2024-11-10 07:14:35,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:35,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:14:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:35,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:14:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:14:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:14:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:14:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:14:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:14:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:14:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:14:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:14:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:14:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:14:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:14:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:14:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:14:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:14:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:14:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:14:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:14:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:14:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:14:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:14:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:14:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:14:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:14:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:14:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:14:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:14:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 07:14:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 07:14:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 07:14:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-10 07:14:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-10 07:14:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 07:14:36,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:36,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394838753] [2024-11-10 07:14:36,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394838753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:14:36,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:14:36,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:14:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810436319] [2024-11-10 07:14:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:14:36,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:14:36,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:36,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:14:36,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:14:36,138 INFO L87 Difference]: Start difference. First operand 150 states and 218 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 07:14:36,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:36,182 INFO L93 Difference]: Finished difference Result 289 states and 421 transitions. [2024-11-10 07:14:36,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:14:36,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 221 [2024-11-10 07:14:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:36,190 INFO L225 Difference]: With dead ends: 289 [2024-11-10 07:14:36,191 INFO L226 Difference]: Without dead ends: 150 [2024-11-10 07:14:36,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:14:36,193 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:36,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 190 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:14:36,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-10 07:14:36,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-10 07:14:36,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 110 states have (on average 1.3) internal successors, (143), 111 states have internal predecessors, (143), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 07:14:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 217 transitions. [2024-11-10 07:14:36,213 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 217 transitions. Word has length 221 [2024-11-10 07:14:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:36,214 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 217 transitions. [2024-11-10 07:14:36,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 07:14:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 217 transitions. [2024-11-10 07:14:36,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-10 07:14:36,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:36,218 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:14:36,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:14:36,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:36,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:36,219 INFO L85 PathProgramCache]: Analyzing trace with hash 692614177, now seen corresponding path program 1 times [2024-11-10 07:14:36,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:36,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860945748] [2024-11-10 07:14:36,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:36,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:14:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:14:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:14:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:14:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:14:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:14:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:14:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:14:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:14:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:14:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:14:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:14:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:14:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:14:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:14:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:14:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:14:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:14:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:14:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:14:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:14:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:14:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:14:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:14:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:14:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:14:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:14:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:14:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 07:14:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 07:14:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 07:14:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-10 07:14:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-10 07:14:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 07:14:36,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:36,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860945748] [2024-11-10 07:14:36,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860945748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:14:36,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:14:36,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:14:36,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683403270] [2024-11-10 07:14:36,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:14:36,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:14:36,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:36,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:14:36,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:14:36,556 INFO L87 Difference]: Start difference. First operand 150 states and 217 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 07:14:36,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:36,612 INFO L93 Difference]: Finished difference Result 289 states and 419 transitions. [2024-11-10 07:14:36,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:14:36,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 222 [2024-11-10 07:14:36,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:36,616 INFO L225 Difference]: With dead ends: 289 [2024-11-10 07:14:36,616 INFO L226 Difference]: Without dead ends: 150 [2024-11-10 07:14:36,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:14:36,617 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:36,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:14:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-10 07:14:36,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-10 07:14:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 110 states have (on average 1.290909090909091) internal successors, (142), 111 states have internal predecessors, (142), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 07:14:36,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 216 transitions. [2024-11-10 07:14:36,637 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 216 transitions. Word has length 222 [2024-11-10 07:14:36,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:36,638 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 216 transitions. [2024-11-10 07:14:36,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 07:14:36,638 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 216 transitions. [2024-11-10 07:14:36,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-10 07:14:36,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:36,642 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:14:36,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 07:14:36,643 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:36,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:36,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1937378658, now seen corresponding path program 1 times [2024-11-10 07:14:36,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:36,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282736006] [2024-11-10 07:14:36,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:36,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:14:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:14:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:14:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:14:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:14:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:14:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:14:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:14:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:14:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:14:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:14:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:14:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:14:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:14:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:14:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:14:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:14:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:14:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:14:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:14:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:14:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:14:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:14:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:14:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:14:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:14:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:14:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:14:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 07:14:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 07:14:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 07:14:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-10 07:14:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-10 07:14:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 18 proven. 78 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-10 07:14:37,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:37,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282736006] [2024-11-10 07:14:37,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282736006] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:14:37,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443796376] [2024-11-10 07:14:37,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:37,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:37,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:14:37,173 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) [2024-11-10 07:14:37,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 07:14:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:14:37,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:14:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 668 proven. 78 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2024-11-10 07:14:37,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:14:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 18 proven. 78 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-10 07:14:38,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443796376] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:14:38,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:14:38,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 07:14:38,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011560353] [2024-11-10 07:14:38,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:14:38,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:14:38,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:38,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:14:38,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:14:38,239 INFO L87 Difference]: Start difference. First operand 150 states and 216 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2024-11-10 07:14:38,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:38,564 INFO L93 Difference]: Finished difference Result 303 states and 432 transitions. [2024-11-10 07:14:38,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:14:38,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 222 [2024-11-10 07:14:38,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:38,567 INFO L225 Difference]: With dead ends: 303 [2024-11-10 07:14:38,568 INFO L226 Difference]: Without dead ends: 164 [2024-11-10 07:14:38,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 506 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:14:38,570 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 201 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:38,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 411 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:14:38,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-10 07:14:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 157. [2024-11-10 07:14:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.263157894736842) internal successors, (144), 115 states have internal predecessors, (144), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 07:14:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 222 transitions. [2024-11-10 07:14:38,589 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 222 transitions. Word has length 222 [2024-11-10 07:14:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:38,590 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 222 transitions. [2024-11-10 07:14:38,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2024-11-10 07:14:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 222 transitions. [2024-11-10 07:14:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-10 07:14:38,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:38,594 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:14:38,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 07:14:38,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:38,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:38,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:38,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1606204800, now seen corresponding path program 1 times [2024-11-10 07:14:38,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:38,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424164666] [2024-11-10 07:14:38,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:38,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:14:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:14:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:14:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:14:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:14:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:14:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:14:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:14:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:14:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:14:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:14:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:14:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:14:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:14:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:14:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:14:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:14:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:14:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:14:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:14:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:14:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:14:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:14:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:14:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:14:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:14:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:14:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:14:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 07:14:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 07:14:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 07:14:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-10 07:14:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-10 07:14:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 07:14:39,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:39,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424164666] [2024-11-10 07:14:39,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424164666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:14:39,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:14:39,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 07:14:39,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785902100] [2024-11-10 07:14:39,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:14:39,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 07:14:39,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:39,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 07:14:39,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:14:39,193 INFO L87 Difference]: Start difference. First operand 157 states and 222 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 07:14:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:39,839 INFO L93 Difference]: Finished difference Result 494 states and 701 transitions. [2024-11-10 07:14:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 07:14:39,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 224 [2024-11-10 07:14:39,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:39,843 INFO L225 Difference]: With dead ends: 494 [2024-11-10 07:14:39,844 INFO L226 Difference]: Without dead ends: 351 [2024-11-10 07:14:39,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:14:39,845 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 376 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:39,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 804 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 07:14:39,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-10 07:14:39,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 246. [2024-11-10 07:14:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 174 states have (on average 1.2586206896551724) internal successors, (219), 175 states have internal predecessors, (219), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 07:14:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 351 transitions. [2024-11-10 07:14:39,893 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 351 transitions. Word has length 224 [2024-11-10 07:14:39,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:39,894 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 351 transitions. [2024-11-10 07:14:39,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 07:14:39,894 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 351 transitions. [2024-11-10 07:14:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-10 07:14:39,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:39,898 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:14:39,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 07:14:39,898 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:39,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:39,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1351468255, now seen corresponding path program 1 times [2024-11-10 07:14:39,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:39,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655822731] [2024-11-10 07:14:39,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:39,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:14:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:14:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:14:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:14:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:14:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:14:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:14:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:14:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:14:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:14:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:14:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:14:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:14:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:14:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:14:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:14:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:14:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:14:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:14:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:14:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:14:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:14:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:14:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:14:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:14:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:14:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:14:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:14:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 07:14:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 07:14:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 07:14:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-10 07:14:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-10 07:14:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 07:14:40,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:40,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655822731] [2024-11-10 07:14:40,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655822731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:14:40,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:14:40,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:14:40,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009550643] [2024-11-10 07:14:40,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:14:40,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:14:40,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:40,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:14:40,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:14:40,805 INFO L87 Difference]: Start difference. First operand 246 states and 351 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 07:14:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:41,131 INFO L93 Difference]: Finished difference Result 425 states and 604 transitions. [2024-11-10 07:14:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:14:41,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 224 [2024-11-10 07:14:41,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:41,135 INFO L225 Difference]: With dead ends: 425 [2024-11-10 07:14:41,135 INFO L226 Difference]: Without dead ends: 246 [2024-11-10 07:14:41,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:14:41,137 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 339 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:41,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 199 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:14:41,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-10 07:14:41,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 210. [2024-11-10 07:14:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 138 states have (on average 1.2028985507246377) internal successors, (166), 139 states have internal predecessors, (166), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 07:14:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 298 transitions. [2024-11-10 07:14:41,170 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 298 transitions. Word has length 224 [2024-11-10 07:14:41,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:41,171 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 298 transitions. [2024-11-10 07:14:41,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 07:14:41,172 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 298 transitions. [2024-11-10 07:14:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-10 07:14:41,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:41,177 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:14:41,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 07:14:41,178 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:41,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:41,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1456391364, now seen corresponding path program 1 times [2024-11-10 07:14:41,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:41,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890764189] [2024-11-10 07:14:41,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:41,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:14:41,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828663760] [2024-11-10 07:14:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:41,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:41,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:14:41,326 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) [2024-11-10 07:14:41,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 07:14:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:41,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 07:14:41,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:14:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 07:14:41,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:14:41,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:41,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890764189] [2024-11-10 07:14:41,628 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 07:14:41,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828663760] [2024-11-10 07:14:41,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828663760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:14:41,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:14:41,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:14:41,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984734365] [2024-11-10 07:14:41,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:14:41,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:14:41,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:41,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:14:41,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:14:41,632 INFO L87 Difference]: Start difference. First operand 210 states and 298 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 07:14:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:41,957 INFO L93 Difference]: Finished difference Result 496 states and 698 transitions. [2024-11-10 07:14:41,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 07:14:41,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 225 [2024-11-10 07:14:41,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:41,962 INFO L225 Difference]: With dead ends: 496 [2024-11-10 07:14:41,963 INFO L226 Difference]: Without dead ends: 353 [2024-11-10 07:14:41,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:14:41,965 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 174 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:41,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 926 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:14:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-10 07:14:42,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 350. [2024-11-10 07:14:42,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 242 states have (on average 1.2272727272727273) internal successors, (297), 243 states have internal predecessors, (297), 99 states have call successors, (99), 8 states have call predecessors, (99), 8 states have return successors, (99), 98 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-10 07:14:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 495 transitions. [2024-11-10 07:14:42,022 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 495 transitions. Word has length 225 [2024-11-10 07:14:42,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:42,023 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 495 transitions. [2024-11-10 07:14:42,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 07:14:42,023 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 495 transitions. [2024-11-10 07:14:42,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-10 07:14:42,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:42,026 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:14:42,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 07:14:42,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-10 07:14:42,227 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:42,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:42,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1652904869, now seen corresponding path program 1 times [2024-11-10 07:14:42,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:42,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92501222] [2024-11-10 07:14:42,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:42,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:14:42,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754334965] [2024-11-10 07:14:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:42,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:42,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:14:42,355 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) [2024-11-10 07:14:42,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 07:14:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:14:42,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:14:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:14:42,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:14:42,834 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:14:42,835 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:14:42,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 07:14:43,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:43,042 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:14:43,206 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:14:43,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:14:43 BoogieIcfgContainer [2024-11-10 07:14:43,212 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:14:43,213 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:14:43,213 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:14:43,214 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:14:43,214 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:14:33" (3/4) ... [2024-11-10 07:14:43,217 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:14:43,221 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:14:43,221 INFO L158 Benchmark]: Toolchain (without parser) took 11663.65ms. Allocated memory was 127.9MB in the beginning and 249.6MB in the end (delta: 121.6MB). Free memory was 71.2MB in the beginning and 166.2MB in the end (delta: -94.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-10 07:14:43,222 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 127.9MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:14:43,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.38ms. Allocated memory was 127.9MB in the beginning and 172.0MB in the end (delta: 44.0MB). Free memory was 71.0MB in the beginning and 141.8MB in the end (delta: -70.9MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-11-10 07:14:43,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.67ms. Allocated memory is still 172.0MB. Free memory was 141.8MB in the beginning and 136.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 07:14:43,222 INFO L158 Benchmark]: Boogie Preprocessor took 96.77ms. Allocated memory is still 172.0MB. Free memory was 136.6MB in the beginning and 130.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 07:14:43,222 INFO L158 Benchmark]: IcfgBuilder took 834.57ms. Allocated memory is still 172.0MB. Free memory was 130.3MB in the beginning and 91.5MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-10 07:14:43,223 INFO L158 Benchmark]: TraceAbstraction took 10182.93ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 90.5MB in the beginning and 166.2MB in the end (delta: -75.7MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. [2024-11-10 07:14:43,223 INFO L158 Benchmark]: Witness Printer took 7.72ms. Allocated memory is still 249.6MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:14:43,224 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.23ms. Allocated memory is still 127.9MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 465.38ms. Allocated memory was 127.9MB in the beginning and 172.0MB in the end (delta: 44.0MB). Free memory was 71.0MB in the beginning and 141.8MB in the end (delta: -70.9MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.67ms. Allocated memory is still 172.0MB. Free memory was 141.8MB in the beginning and 136.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.77ms. Allocated memory is still 172.0MB. Free memory was 136.6MB in the beginning and 130.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 834.57ms. Allocated memory is still 172.0MB. Free memory was 130.3MB in the beginning and 91.5MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10182.93ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 90.5MB in the beginning and 166.2MB in the end (delta: -75.7MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. * Witness Printer took 7.72ms. Allocated memory is still 249.6MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 16.1GB. * 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 190, overapproximation of shiftRight at line 91, overapproximation of someBinaryArithmeticDOUBLEoperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 190. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 1; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_8 = 0; [L26] signed short int var_1_9 = 256; [L27] signed short int var_1_10 = -25; [L28] unsigned char var_1_11 = 1; [L29] unsigned char var_1_12 = 0; [L30] float var_1_13 = 256.75; [L31] float var_1_15 = 256.25; [L32] float var_1_16 = 8.95; [L33] float var_1_17 = 256.375; [L34] float var_1_18 = 0.0; [L35] float var_1_19 = 3.75; [L36] unsigned short int var_1_20 = 64; [L37] unsigned short int var_1_21 = 0; [L38] float var_1_22 = 100.5; [L39] unsigned short int var_1_23 = 50; [L40] unsigned short int var_1_24 = 64; [L41] double var_1_25 = 32.6; [L42] unsigned char var_1_26 = 1; [L43] unsigned char var_1_28 = 0; [L44] double var_1_29 = 100.4; [L45] signed short int var_1_30 = 2; [L46] signed short int var_1_31 = 16; [L47] signed short int var_1_32 = 8; [L48] signed short int var_1_33 = 2; [L49] double var_1_34 = 0.0; [L50] double var_1_35 = 63.8; [L51] double var_1_36 = 127.75; [L52] double var_1_37 = 0.4; [L53] unsigned long int var_1_38 = 50; [L54] unsigned long int var_1_39 = 3554953517; [L55] unsigned char var_1_40 = 0; [L56] unsigned short int var_1_41 = 4; VAL [isInitial=0, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L194] isInitial = 1 [L195] FCALL initially() [L196] COND TRUE 1 [L197] FCALL updateLastVariables() [L198] CALL updateVariables() [L132] var_1_4 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L133] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L134] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L134] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L135] var_1_8 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_9=256] [L136] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_9=256] [L137] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L137] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L138] var_1_10 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_10 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L139] RET assume_abort_if_not(var_1_10 >= -32767) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L140] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L140] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L141] var_1_12 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L142] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L143] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L143] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L144] var_1_15 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L145] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L146] var_1_16 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L147] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L148] var_1_17 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L149] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L150] var_1_18 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L151] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L152] var_1_19 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L153] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L154] var_1_21 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L155] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L156] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L156] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L157] var_1_24 = __VERIFIER_nondet_ushort() [L158] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L158] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L159] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L159] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L160] var_1_28 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L161] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L162] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L162] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L163] var_1_30 = __VERIFIER_nondet_short() [L164] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L164] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L165] CALL assume_abort_if_not(var_1_30 <= 16384) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L165] RET assume_abort_if_not(var_1_30 <= 16384) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L166] var_1_31 = __VERIFIER_nondet_short() [L167] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L167] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L168] CALL assume_abort_if_not(var_1_31 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L168] RET assume_abort_if_not(var_1_31 <= 16383) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L169] var_1_32 = __VERIFIER_nondet_short() [L170] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L170] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L171] CALL assume_abort_if_not(var_1_32 <= 9) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L171] RET assume_abort_if_not(var_1_32 <= 9) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L172] var_1_33 = __VERIFIER_nondet_short() [L173] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L173] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L174] CALL assume_abort_if_not(var_1_33 <= 8) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L174] RET assume_abort_if_not(var_1_33 <= 8) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L175] var_1_34 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_34 >= 4611686.018427382800e+12F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L176] RET assume_abort_if_not((var_1_34 >= 4611686.018427382800e+12F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L177] var_1_35 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 2305843.009213691390e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L178] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 2305843.009213691390e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L179] var_1_36 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 2305843.009213691390e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L180] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 2305843.009213691390e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L181] var_1_37 = __VERIFIER_nondet_double() [L182] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L182] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L183] var_1_39 = __VERIFIER_nondet_ulong() [L184] CALL assume_abort_if_not(var_1_39 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L184] RET assume_abort_if_not(var_1_39 >= 3221225470) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L185] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L185] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=65536, var_1_22=201/2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L198] RET updateVariables() [L199] CALL step() [L60] var_1_9 = ((((-10) < (var_1_10)) ? (-10) : (var_1_10))) [L61] var_1_11 = ((var_1_8 || var_1_4) && var_1_12) [L62] var_1_20 = (45013 - var_1_21) [L63] var_1_22 = ((((((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) > (var_1_17)) ? (((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) : (var_1_17))) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=50, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=-32767] [L64] COND TRUE (9999999.6 / var_1_18) > var_1_16 [L65] var_1_23 = ((((var_1_21 + var_1_24) < 0 ) ? -(var_1_21 + var_1_24) : (var_1_21 + var_1_24))) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=-32767] [L67] var_1_25 = (((((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) > (var_1_16)) ? ((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) : (var_1_16))) [L68] var_1_40 = var_1_28 [L69] var_1_41 = 10 VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=-32767] [L70] COND FALSE !(var_1_9 >= var_1_23) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=-32767] [L73] signed long int stepLocal_0 = var_1_20 - var_1_23; VAL [isInitial=1, stepLocal_0=45013, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=-32767] [L74] COND TRUE var_1_20 <= stepLocal_0 [L75] var_1_5 = (var_1_1 || var_1_4) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L79] unsigned short int stepLocal_1 = var_1_23; VAL [isInitial=1, stepLocal_1=0, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L80] COND TRUE \read(var_1_1) VAL [isInitial=1, stepLocal_1=0, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L81] COND FALSE !(stepLocal_1 > var_1_23) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L87] unsigned short int stepLocal_5 = var_1_41; [L88] signed long int stepLocal_4 = (var_1_30 + var_1_31) - var_1_21; VAL [isInitial=1, stepLocal_4=0, stepLocal_5=10, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L89] EXPR var_1_21 >> (var_1_32 + var_1_33) VAL [isInitial=1, stepLocal_4=0, stepLocal_5=10, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L89] signed long int stepLocal_3 = var_1_21 >> (var_1_32 + var_1_33); [L90] COND TRUE \read(var_1_12) VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_5=10, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L91] EXPR var_1_9 >> var_1_41 VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_5=10, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L91] COND FALSE !(stepLocal_5 <= (var_1_9 >> var_1_41)) [L101] signed short int stepLocal_9 = var_1_9; VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_9=-32767, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L102] EXPR var_1_31 & (var_1_20 * var_1_20) VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_9=-32767, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L102] signed long int stepLocal_8 = var_1_31 & (var_1_20 * var_1_20); [L103] EXPR var_1_30 >> var_1_9 VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_8=0, stepLocal_9=-32767, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L103] signed long int stepLocal_7 = var_1_30 >> var_1_9; [L104] unsigned short int stepLocal_6 = var_1_20; VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_7=0, stepLocal_8=0, stepLocal_9=-32767, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L105] COND TRUE var_1_17 >= (- var_1_34) VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_7=0, stepLocal_8=0, stepLocal_9=-32767, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L106] COND FALSE !(stepLocal_6 <= -1) [L111] var_1_38 = ((var_1_39 - (var_1_20 + 500u)) - 4u) VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_7=0, stepLocal_8=0, stepLocal_9=-32767, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L126] signed long int stepLocal_2 = var_1_24 * var_1_23; VAL [isInitial=1, stepLocal_2=0, stepLocal_3=0, stepLocal_4=0, stepLocal_7=0, stepLocal_8=0, stepLocal_9=-32767, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L127] COND FALSE !(stepLocal_2 > (var_1_41 - var_1_38)) VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_7=0, stepLocal_8=0, stepLocal_9=-32767, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L199] RET step() [L200] CALL, EXPR property() [L190] EXPR (((((((((((var_1_9 >= var_1_23) ? (var_1_1 == ((unsigned char) (! var_1_4))) : 1) && ((var_1_20 <= (var_1_20 - var_1_23)) ? (var_1_5 == ((unsigned char) (var_1_1 || var_1_4))) : (var_1_5 == ((unsigned char) (! (! var_1_8)))))) && (var_1_9 == ((signed short int) ((((-10) < (var_1_10)) ? (-10) : (var_1_10)))))) && (var_1_11 == ((unsigned char) ((var_1_8 || var_1_4) && var_1_12)))) && (var_1_1 ? ((var_1_23 > var_1_23) ? (var_1_13 == ((float) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1) : (var_1_13 == ((float) ((((var_1_17 - (var_1_18 - var_1_19)) < 0 ) ? -(var_1_17 - (var_1_18 - var_1_19)) : (var_1_17 - (var_1_18 - var_1_19)))))))) && (var_1_20 == ((unsigned short int) (45013 - var_1_21)))) && (var_1_22 == ((float) ((((((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) > (var_1_17)) ? (((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) : (var_1_17)))))) && (((9999999.6 / var_1_18) > var_1_16) ? (var_1_23 == ((unsigned short int) ((((var_1_21 + var_1_24) < 0 ) ? -(var_1_21 + var_1_24) : (var_1_21 + var_1_24))))) : 1)) && (var_1_25 == ((double) (((((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) > (var_1_16)) ? ((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) : (var_1_16)))))) && (((var_1_24 * var_1_23) > (var_1_41 - var_1_38)) ? (var_1_26 == ((unsigned char) (! ((var_1_4 && var_1_12) && var_1_28)))) : 1)) && (var_1_12 ? ((var_1_41 <= (var_1_9 >> var_1_41)) ? ((((var_1_30 + var_1_31) - var_1_21) >= 128) ? (((var_1_24 - var_1_41) <= (var_1_21 >> (var_1_32 + var_1_33))) ? (var_1_29 == ((double) (-0.4 + var_1_19))) : (var_1_29 == ((double) ((((((var_1_18) < (var_1_34)) ? (var_1_18) : (var_1_34))) - var_1_19) - ((var_1_35 + var_1_36) + var_1_37))))) : 1) : 1) : 1) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L190] EXPR ((((((((((((var_1_9 >= var_1_23) ? (var_1_1 == ((unsigned char) (! var_1_4))) : 1) && ((var_1_20 <= (var_1_20 - var_1_23)) ? (var_1_5 == ((unsigned char) (var_1_1 || var_1_4))) : (var_1_5 == ((unsigned char) (! (! var_1_8)))))) && (var_1_9 == ((signed short int) ((((-10) < (var_1_10)) ? (-10) : (var_1_10)))))) && (var_1_11 == ((unsigned char) ((var_1_8 || var_1_4) && var_1_12)))) && (var_1_1 ? ((var_1_23 > var_1_23) ? (var_1_13 == ((float) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1) : (var_1_13 == ((float) ((((var_1_17 - (var_1_18 - var_1_19)) < 0 ) ? -(var_1_17 - (var_1_18 - var_1_19)) : (var_1_17 - (var_1_18 - var_1_19)))))))) && (var_1_20 == ((unsigned short int) (45013 - var_1_21)))) && (var_1_22 == ((float) ((((((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) > (var_1_17)) ? (((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) : (var_1_17)))))) && (((9999999.6 / var_1_18) > var_1_16) ? (var_1_23 == ((unsigned short int) ((((var_1_21 + var_1_24) < 0 ) ? -(var_1_21 + var_1_24) : (var_1_21 + var_1_24))))) : 1)) && (var_1_25 == ((double) (((((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) > (var_1_16)) ? ((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) : (var_1_16)))))) && (((var_1_24 * var_1_23) > (var_1_41 - var_1_38)) ? (var_1_26 == ((unsigned char) (! ((var_1_4 && var_1_12) && var_1_28)))) : 1)) && (var_1_12 ? ((var_1_41 <= (var_1_9 >> var_1_41)) ? ((((var_1_30 + var_1_31) - var_1_21) >= 128) ? (((var_1_24 - var_1_41) <= (var_1_21 >> (var_1_32 + var_1_33))) ? (var_1_29 == ((double) (-0.4 + var_1_19))) : (var_1_29 == ((double) ((((((var_1_18) < (var_1_34)) ? (var_1_18) : (var_1_34))) - var_1_19) - ((var_1_35 + var_1_36) + var_1_37))))) : 1) : 1) : 1)) && ((var_1_17 >= (- var_1_34)) ? ((var_1_20 <= -1) ? (((~ var_1_30) > (var_1_31 & (var_1_20 * var_1_20))) ? (var_1_38 == ((unsigned long int) var_1_24)) : 1) : (var_1_38 == ((unsigned long int) ((var_1_39 - (var_1_20 + 500u)) - 4u)))) : ((var_1_9 <= (var_1_9 ^ var_1_32)) ? ((var_1_15 <= var_1_13) ? (((var_1_24 * var_1_9) <= (var_1_30 >> var_1_9)) ? (var_1_38 == ((unsigned long int) var_1_41)) : (var_1_38 == ((unsigned long int) var_1_39))) : (var_1_38 == ((unsigned long int) var_1_21))) : 1)) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L190-L191] return ((((((((((((((var_1_9 >= var_1_23) ? (var_1_1 == ((unsigned char) (! var_1_4))) : 1) && ((var_1_20 <= (var_1_20 - var_1_23)) ? (var_1_5 == ((unsigned char) (var_1_1 || var_1_4))) : (var_1_5 == ((unsigned char) (! (! var_1_8)))))) && (var_1_9 == ((signed short int) ((((-10) < (var_1_10)) ? (-10) : (var_1_10)))))) && (var_1_11 == ((unsigned char) ((var_1_8 || var_1_4) && var_1_12)))) && (var_1_1 ? ((var_1_23 > var_1_23) ? (var_1_13 == ((float) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1) : (var_1_13 == ((float) ((((var_1_17 - (var_1_18 - var_1_19)) < 0 ) ? -(var_1_17 - (var_1_18 - var_1_19)) : (var_1_17 - (var_1_18 - var_1_19)))))))) && (var_1_20 == ((unsigned short int) (45013 - var_1_21)))) && (var_1_22 == ((float) ((((((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) > (var_1_17)) ? (((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) : (var_1_17)))))) && (((9999999.6 / var_1_18) > var_1_16) ? (var_1_23 == ((unsigned short int) ((((var_1_21 + var_1_24) < 0 ) ? -(var_1_21 + var_1_24) : (var_1_21 + var_1_24))))) : 1)) && (var_1_25 == ((double) (((((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) > (var_1_16)) ? ((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) : (var_1_16)))))) && (((var_1_24 * var_1_23) > (var_1_41 - var_1_38)) ? (var_1_26 == ((unsigned char) (! ((var_1_4 && var_1_12) && var_1_28)))) : 1)) && (var_1_12 ? ((var_1_41 <= (var_1_9 >> var_1_41)) ? ((((var_1_30 + var_1_31) - var_1_21) >= 128) ? (((var_1_24 - var_1_41) <= (var_1_21 >> (var_1_32 + var_1_33))) ? (var_1_29 == ((double) (-0.4 + var_1_19))) : (var_1_29 == ((double) ((((((var_1_18) < (var_1_34)) ? (var_1_18) : (var_1_34))) - var_1_19) - ((var_1_35 + var_1_36) + var_1_37))))) : 1) : 1) : 1)) && ((var_1_17 >= (- var_1_34)) ? ((var_1_20 <= -1) ? (((~ var_1_30) > (var_1_31 & (var_1_20 * var_1_20))) ? (var_1_38 == ((unsigned long int) var_1_24)) : 1) : (var_1_38 == ((unsigned long int) ((var_1_39 - (var_1_20 + 500u)) - 4u)))) : ((var_1_9 <= (var_1_9 ^ var_1_32)) ? ((var_1_15 <= var_1_13) ? (((var_1_24 * var_1_9) <= (var_1_30 >> var_1_9)) ? (var_1_38 == ((unsigned long int) var_1_41)) : (var_1_38 == ((unsigned long int) var_1_39))) : (var_1_38 == ((unsigned long int) var_1_21))) : 1))) && (var_1_40 == ((unsigned char) var_1_28))) && (var_1_41 == ((unsigned short int) 10)) ; [L200] RET, EXPR property() [L200] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] [L19] reach_error() VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=65536, var_1_22=2, var_1_23=0, var_1_24=-131072, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 148 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 9, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1498 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1492 mSDsluCounter, 3310 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1546 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1110 IncrementalHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 1764 mSDtfsCounter, 1110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1206 GetRequests, 1176 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=8, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 152 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 2677 NumberOfCodeBlocks, 2677 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2214 ConstructedInterpolants, 0 QuantifiedInterpolants, 4805 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1001 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 20886/21120 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 [2024-11-10 07:14:43,271 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-44.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9d7a0d6a4070f07d0273890c187a2843c127b373fc69a2a4cf38dcf6ecd96bde --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:14:45,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:14:45,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:14:45,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:14:45,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:14:45,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:14:45,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:14:45,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:14:45,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:14:45,859 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:14:45,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:14:45,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:14:45,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:14:45,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:14:45,863 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:14:45,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:14:45,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:14:45,868 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:14:45,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:14:45,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:14:45,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:14:45,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:14:45,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:14:45,870 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:14:45,871 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:14:45,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:14:45,871 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:14:45,871 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:14:45,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:14:45,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:14:45,872 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:14:45,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:14:45,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:14:45,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:14:45,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:14:45,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:14:45,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:14:45,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:14:45,877 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:14:45,877 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:14:45,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:14:45,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:14:45,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:14:45,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:14:45,878 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9d7a0d6a4070f07d0273890c187a2843c127b373fc69a2a4cf38dcf6ecd96bde [2024-11-10 07:14:46,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:14:46,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:14:46,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:14:46,262 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:14:46,262 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:14:46,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-44.i [2024-11-10 07:14:48,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:14:48,267 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:14:48,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-44.i [2024-11-10 07:14:48,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a314ad35c/247087d6f3e54ab6a7afd8ed80433055/FLAG8f7704549 [2024-11-10 07:14:48,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a314ad35c/247087d6f3e54ab6a7afd8ed80433055 [2024-11-10 07:14:48,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:14:48,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:14:48,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:14:48,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:14:48,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:14:48,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:14:48" (1/1) ... [2024-11-10 07:14:48,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788cdd02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:48, skipping insertion in model container [2024-11-10 07:14:48,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:14:48" (1/1) ... [2024-11-10 07:14:48,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:14:48,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-44.i[916,929] [2024-11-10 07:14:48,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:14:48,703 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:14:48,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-44.i[916,929] [2024-11-10 07:14:48,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:14:48,805 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:14:48,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:48 WrapperNode [2024-11-10 07:14:48,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:14:48,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:14:48,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:14:48,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:14:48,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:48" (1/1) ... [2024-11-10 07:14:48,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:48" (1/1) ... [2024-11-10 07:14:48,875 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-10 07:14:48,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:14:48,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:14:48,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:14:48,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:14:48,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:48" (1/1) ... [2024-11-10 07:14:48,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:48" (1/1) ... [2024-11-10 07:14:48,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:48" (1/1) ... [2024-11-10 07:14:48,918 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]. [2024-11-10 07:14:48,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:48" (1/1) ... [2024-11-10 07:14:48,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:48" (1/1) ... [2024-11-10 07:14:48,931 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:48" (1/1) ... [2024-11-10 07:14:48,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:48" (1/1) ... [2024-11-10 07:14:48,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:48" (1/1) ... [2024-11-10 07:14:48,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:48" (1/1) ... [2024-11-10 07:14:48,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:14:48,949 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:14:48,949 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:14:48,949 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:14:48,950 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:48" (1/1) ... [2024-11-10 07:14:48,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:14:48,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:14:48,995 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) [2024-11-10 07:14:48,998 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 [2024-11-10 07:14:49,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:14:49,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:14:49,044 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:14:49,045 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:14:49,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:14:49,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:14:49,138 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:14:49,140 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:15:10,399 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-10 07:15:10,399 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:15:10,419 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:15:10,420 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:15:10,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:15:10 BoogieIcfgContainer [2024-11-10 07:15:10,421 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:15:10,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:15:10,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:15:10,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:15:10,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:14:48" (1/3) ... [2024-11-10 07:15:10,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32130c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:15:10, skipping insertion in model container [2024-11-10 07:15:10,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:48" (2/3) ... [2024-11-10 07:15:10,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32130c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:15:10, skipping insertion in model container [2024-11-10 07:15:10,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:15:10" (3/3) ... [2024-11-10 07:15:10,432 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-44.i [2024-11-10 07:15:10,447 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:15:10,447 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:15:10,505 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:15:10,514 INFO L333 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, 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;@11f08e29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:15:10,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:15:10,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 63 states have internal predecessors, (83), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 07:15:10,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 07:15:10,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:15:10,538 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:15:10,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:15:10,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:15:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash 590678060, now seen corresponding path program 1 times [2024-11-10 07:15:10,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:15:10,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662564187] [2024-11-10 07:15:10,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:15:10,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:15:10,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:15:10,592 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:15:10,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 07:15:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:15:11,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:15:11,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:15:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 988 proven. 0 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2024-11-10 07:15:11,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:15:11,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:15:11,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662564187] [2024-11-10 07:15:11,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662564187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:15:11,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:15:11,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:15:11,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329888519] [2024-11-10 07:15:11,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:15:11,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:15:11,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:15:12,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:15:12,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:15:12,010 INFO L87 Difference]: Start difference. First operand has 98 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 63 states have internal predecessors, (83), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 07:15:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:15:12,051 INFO L93 Difference]: Finished difference Result 187 states and 322 transitions. [2024-11-10 07:15:12,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:15:12,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 211 [2024-11-10 07:15:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:15:12,070 INFO L225 Difference]: With dead ends: 187 [2024-11-10 07:15:12,071 INFO L226 Difference]: Without dead ends: 92 [2024-11-10 07:15:12,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:15:12,079 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:15:12,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:15:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-10 07:15:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-10 07:15:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 07:15:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 138 transitions. [2024-11-10 07:15:12,130 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 138 transitions. Word has length 211 [2024-11-10 07:15:12,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:15:12,130 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 138 transitions. [2024-11-10 07:15:12,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 07:15:12,131 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 138 transitions. [2024-11-10 07:15:12,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 07:15:12,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:15:12,139 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:15:12,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 07:15:12,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:15:12,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:15:12,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:15:12,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1703586323, now seen corresponding path program 1 times [2024-11-10 07:15:12,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:15:12,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098838812] [2024-11-10 07:15:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:15:12,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:15:12,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:15:12,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:15:12,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 07:15:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:15:13,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 07:15:13,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:15:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 07:15:20,733 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:15:20,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:15:20,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098838812] [2024-11-10 07:15:20,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098838812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:15:20,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:15:20,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:15:20,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803614744] [2024-11-10 07:15:20,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:15:20,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:15:20,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:15:20,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:15:20,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:15:20,740 INFO L87 Difference]: Start difference. First operand 92 states and 138 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 07:15:25,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:15:29,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:15:29,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:15:29,568 INFO L93 Difference]: Finished difference Result 270 states and 408 transitions. [2024-11-10 07:15:29,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:15:29,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-10 07:15:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:15:29,737 INFO L225 Difference]: With dead ends: 270 [2024-11-10 07:15:29,737 INFO L226 Difference]: Without dead ends: 181 [2024-11-10 07:15:29,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:15:29,740 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 34 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-10 07:15:29,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 294 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-11-10 07:15:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-10 07:15:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2024-11-10 07:15:29,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 109 states have (on average 1.2660550458715596) internal successors, (138), 109 states have internal predecessors, (138), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 07:15:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 270 transitions. [2024-11-10 07:15:29,783 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 270 transitions. Word has length 211 [2024-11-10 07:15:29,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:15:29,784 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 270 transitions. [2024-11-10 07:15:29,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 07:15:29,785 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 270 transitions. [2024-11-10 07:15:29,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 07:15:29,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:15:29,788 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:15:29,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 07:15:29,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:15:29,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:15:29,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:15:29,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1238071276, now seen corresponding path program 1 times [2024-11-10 07:15:29,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:15:29,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917710115] [2024-11-10 07:15:29,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:15:29,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:15:29,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:15:29,993 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:15:29,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 07:15:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:15:31,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 07:15:31,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:15:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 07:15:31,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:15:31,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:15:31,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917710115] [2024-11-10 07:15:31,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917710115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:15:31,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:15:31,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:15:31,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858743750] [2024-11-10 07:15:31,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:15:31,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:15:31,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:15:31,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:15:31,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:15:31,761 INFO L87 Difference]: Start difference. First operand 178 states and 270 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 07:15:36,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 07:15:36,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:15:36,414 INFO L93 Difference]: Finished difference Result 326 states and 493 transitions. [2024-11-10 07:15:36,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:15:36,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-10 07:15:36,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:15:36,581 INFO L225 Difference]: With dead ends: 326 [2024-11-10 07:15:36,581 INFO L226 Difference]: Without dead ends: 151 [2024-11-10 07:15:36,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:15:36,584 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 125 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-10 07:15:36,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 310 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-11-10 07:15:36,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-10 07:15:36,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 90. [2024-11-10 07:15:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 07:15:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2024-11-10 07:15:36,616 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 211 [2024-11-10 07:15:36,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:15:36,617 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2024-11-10 07:15:36,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 07:15:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2024-11-10 07:15:36,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-10 07:15:36,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:15:36,621 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:15:36,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 07:15:36,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:15:36,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:15:36,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:15:36,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1634057957, now seen corresponding path program 1 times [2024-11-10 07:15:36,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:15:36,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932063268] [2024-11-10 07:15:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:15:36,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:15:36,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:15:36,827 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:15:36,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 07:15:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:15:37,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 07:15:38,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:15:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 07:15:38,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:15:38,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:15:38,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932063268] [2024-11-10 07:15:38,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932063268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:15:38,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:15:38,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:15:38,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138780937] [2024-11-10 07:15:38,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:15:38,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:15:38,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:15:38,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:15:38,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:15:38,182 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 07:15:42,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:15:47,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:15:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:15:47,113 INFO L93 Difference]: Finished difference Result 177 states and 259 transitions. [2024-11-10 07:15:47,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:15:47,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2024-11-10 07:15:47,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:15:47,263 INFO L225 Difference]: With dead ends: 177 [2024-11-10 07:15:47,263 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 07:15:47,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:15:47,265 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-10 07:15:47,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2024-11-10 07:15:47,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 07:15:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-10 07:15:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 07:15:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 130 transitions. [2024-11-10 07:15:47,287 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 130 transitions. Word has length 212 [2024-11-10 07:15:47,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:15:47,288 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 130 transitions. [2024-11-10 07:15:47,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 07:15:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2024-11-10 07:15:47,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-10 07:15:47,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:15:47,294 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:15:47,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 07:15:47,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:15:47,495 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:15:47,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:15:47,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1340654950, now seen corresponding path program 1 times [2024-11-10 07:15:47,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:15:47,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473657112] [2024-11-10 07:15:47,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:15:47,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:15:47,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:15:47,499 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:15:47,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 07:15:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:15:48,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 07:15:48,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:15:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 668 proven. 78 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2024-11-10 07:15:54,828 INFO L311 TraceCheckSpWp]: Computing backward predicates...