./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_fillercode_fillercodesize_ps-cn-10_file-40.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 a5c1f731c6afd6eda80ecc2a1a4422b310bbf0b35c642eb8cecc45d271c75d56 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:59:36,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:59:36,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:59:36,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:59:36,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:59:36,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:59:36,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:59:36,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:59:36,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:59:36,224 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:59:36,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:59:36,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:59:36,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:59:36,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:59:36,228 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:59:36,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:59:36,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:59:36,228 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:59:36,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:59:36,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:59:36,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:59:36,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:59:36,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:59:36,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:59:36,233 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:59:36,233 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:59:36,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:59:36,233 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:59:36,233 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:59:36,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:59:36,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:59:36,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:59:36,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:59:36,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:59:36,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:59:36,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:59:36,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:59:36,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:59:36,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:59:36,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:59:36,235 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:59:36,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:59:36,236 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 -> a5c1f731c6afd6eda80ecc2a1a4422b310bbf0b35c642eb8cecc45d271c75d56 [2024-11-16 12:59:36,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:59:36,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:59:36,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:59:36,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:59:36,439 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:59:36,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-40.i [2024-11-16 12:59:37,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:59:37,803 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:59:37,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-40.i [2024-11-16 12:59:37,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6c343f6d/c8a620633e6b466789528098b77ae537/FLAG124e37e59 [2024-11-16 12:59:38,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6c343f6d/c8a620633e6b466789528098b77ae537 [2024-11-16 12:59:38,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:59:38,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:59:38,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:59:38,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:59:38,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:59:38,177 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:59:38" (1/1) ... [2024-11-16 12:59:38,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f00e9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:38, skipping insertion in model container [2024-11-16 12:59:38,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:59:38" (1/1) ... [2024-11-16 12:59:38,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:59:38,334 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_fillercode_fillercodesize_ps-cn-10_file-40.i[915,928] [2024-11-16 12:59:38,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:59:38,417 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:59:38,425 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_fillercode_fillercodesize_ps-cn-10_file-40.i[915,928] [2024-11-16 12:59:38,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:59:38,460 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:59:38,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:38 WrapperNode [2024-11-16 12:59:38,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:59:38,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:59:38,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:59:38,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:59:38,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:38" (1/1) ... [2024-11-16 12:59:38,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:38" (1/1) ... [2024-11-16 12:59:38,511 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-11-16 12:59:38,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:59:38,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:59:38,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:59:38,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:59:38,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:38" (1/1) ... [2024-11-16 12:59:38,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:38" (1/1) ... [2024-11-16 12:59:38,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:38" (1/1) ... [2024-11-16 12:59:38,540 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-16 12:59:38,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:38" (1/1) ... [2024-11-16 12:59:38,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:38" (1/1) ... [2024-11-16 12:59:38,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:38" (1/1) ... [2024-11-16 12:59:38,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:38" (1/1) ... [2024-11-16 12:59:38,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:38" (1/1) ... [2024-11-16 12:59:38,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:38" (1/1) ... [2024-11-16 12:59:38,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:59:38,557 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:59:38,557 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:59:38,558 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:59:38,559 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:38" (1/1) ... [2024-11-16 12:59:38,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:59:38,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:59:38,589 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-16 12:59:38,591 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-16 12:59:38,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:59:38,626 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:59:38,627 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:59:38,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:59:38,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:59:38,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:59:38,699 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:59:38,700 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:59:38,955 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 12:59:38,955 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:59:38,969 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:59:38,970 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:59:38,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:59:38 BoogieIcfgContainer [2024-11-16 12:59:38,971 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:59:38,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:59:38,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:59:38,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:59:38,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:59:38" (1/3) ... [2024-11-16 12:59:38,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242ccbfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:59:38, skipping insertion in model container [2024-11-16 12:59:38,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:38" (2/3) ... [2024-11-16 12:59:38,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242ccbfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:59:38, skipping insertion in model container [2024-11-16 12:59:38,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:59:38" (3/3) ... [2024-11-16 12:59:38,978 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-40.i [2024-11-16 12:59:38,995 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:59:38,995 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:59:39,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:59:39,045 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;@de826ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:59:39,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:59:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-16 12:59:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 12:59:39,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:39,061 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:59:39,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:39,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash -381125966, now seen corresponding path program 1 times [2024-11-16 12:59:39,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:59:39,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716567033] [2024-11-16 12:59:39,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:39,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:59:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:59:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:59:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 12:59:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:59:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:59:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:59:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:59:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:59:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:59:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:59:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:59:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:59:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:59:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:59:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:59:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:59:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:59:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:59:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:59:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-16 12:59:39,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:59:39,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716567033] [2024-11-16 12:59:39,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716567033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:59:39,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:59:39,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:59:39,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598829010] [2024-11-16 12:59:39,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:59:39,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:59:39,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:59:39,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:59:39,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:59:39,431 INFO L87 Difference]: Start difference. First operand has 66 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-16 12:59:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:59:39,455 INFO L93 Difference]: Finished difference Result 124 states and 208 transitions. [2024-11-16 12:59:39,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:59:39,456 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2024-11-16 12:59:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:59:39,463 INFO L225 Difference]: With dead ends: 124 [2024-11-16 12:59:39,463 INFO L226 Difference]: Without dead ends: 61 [2024-11-16 12:59:39,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:59:39,470 INFO L432 NwaCegarLoop]: 89 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, 89 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-16 12:59:39,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:59:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-16 12:59:39,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-16 12:59:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-16 12:59:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2024-11-16 12:59:39,549 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 127 [2024-11-16 12:59:39,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:59:39,550 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2024-11-16 12:59:39,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-16 12:59:39,550 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2024-11-16 12:59:39,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 12:59:39,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:39,555 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:59:39,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:59:39,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:39,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:39,560 INFO L85 PathProgramCache]: Analyzing trace with hash 458151218, now seen corresponding path program 1 times [2024-11-16 12:59:39,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:59:39,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001229548] [2024-11-16 12:59:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:39,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:59:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:59:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:59:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 12:59:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:59:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:59:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:59:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:59:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:59:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:59:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:59:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:59:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:59:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:59:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:59:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:59:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:59:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:59:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:59:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:59:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-16 12:59:39,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:59:39,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001229548] [2024-11-16 12:59:39,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001229548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:59:39,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:59:39,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:59:39,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676369670] [2024-11-16 12:59:39,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:59:39,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:59:39,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:59:39,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:59:39,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:59:39,790 INFO L87 Difference]: Start difference. First operand 61 states and 89 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-16 12:59:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:59:39,806 INFO L93 Difference]: Finished difference Result 119 states and 175 transitions. [2024-11-16 12:59:39,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:59:39,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2024-11-16 12:59:39,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:59:39,809 INFO L225 Difference]: With dead ends: 119 [2024-11-16 12:59:39,809 INFO L226 Difference]: Without dead ends: 61 [2024-11-16 12:59:39,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-16 12:59:39,810 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:59:39,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:59:39,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-16 12:59:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-16 12:59:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-16 12:59:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2024-11-16 12:59:39,818 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 128 [2024-11-16 12:59:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:59:39,819 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2024-11-16 12:59:39,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-16 12:59:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2024-11-16 12:59:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 12:59:39,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:39,821 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:59:39,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:59:39,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:39,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:39,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1349303245, now seen corresponding path program 1 times [2024-11-16 12:59:39,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:59:39,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932577474] [2024-11-16 12:59:39,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:39,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:59:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:59:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:59:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 12:59:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:59:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:59:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:59:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:59:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:59:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:59:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:59:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:59:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:59:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:59:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:59:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:59:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:59:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:59:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:59:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:59:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-16 12:59:40,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:59:40,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932577474] [2024-11-16 12:59:40,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932577474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:59:40,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:59:40,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:59:40,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101034256] [2024-11-16 12:59:40,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:59:40,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:59:40,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:59:40,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:59:40,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:59:40,528 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-16 12:59:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:59:40,801 INFO L93 Difference]: Finished difference Result 204 states and 287 transitions. [2024-11-16 12:59:40,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:59:40,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2024-11-16 12:59:40,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:59:40,805 INFO L225 Difference]: With dead ends: 204 [2024-11-16 12:59:40,806 INFO L226 Difference]: Without dead ends: 146 [2024-11-16 12:59:40,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:59:40,808 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 103 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:59:40,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 292 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:59:40,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-16 12:59:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2024-11-16 12:59:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.234375) internal successors, (79), 65 states have internal predecessors, (79), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 12:59:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2024-11-16 12:59:40,825 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 128 [2024-11-16 12:59:40,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:59:40,825 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2024-11-16 12:59:40,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-16 12:59:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2024-11-16 12:59:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 12:59:40,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:40,827 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:59:40,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:59:40,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:40,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:40,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1320674094, now seen corresponding path program 1 times [2024-11-16 12:59:40,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:59:40,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742985939] [2024-11-16 12:59:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:40,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:59:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:59:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:59:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 12:59:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:40,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:59:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:59:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:59:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:59:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:59:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:59:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:59:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:59:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:59:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:59:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:59:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:59:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:59:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:59:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:59:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:59:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 24 proven. 30 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-16 12:59:41,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:59:41,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742985939] [2024-11-16 12:59:41,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742985939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:59:41,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932974062] [2024-11-16 12:59:41,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:41,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:59:41,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:59:41,060 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-16 12:59:41,061 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-16 12:59:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:41,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 12:59:41,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:59:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 354 proven. 30 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-16 12:59:41,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:59:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 24 proven. 30 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-16 12:59:41,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932974062] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:59:41,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 12:59:41,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-16 12:59:41,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617720815] [2024-11-16 12:59:41,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 12:59:41,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:59:41,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:59:41,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:59:41,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:59:41,495 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-16 12:59:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:59:41,627 INFO L93 Difference]: Finished difference Result 166 states and 229 transitions. [2024-11-16 12:59:41,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 12:59:41,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 128 [2024-11-16 12:59:41,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:59:41,629 INFO L225 Difference]: With dead ends: 166 [2024-11-16 12:59:41,629 INFO L226 Difference]: Without dead ends: 74 [2024-11-16 12:59:41,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:59:41,631 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:59:41,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 134 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:59:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-16 12:59:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-11-16 12:59:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-16 12:59:41,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2024-11-16 12:59:41,644 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 128 [2024-11-16 12:59:41,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:59:41,644 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2024-11-16 12:59:41,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-16 12:59:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2024-11-16 12:59:41,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 12:59:41,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:41,646 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:59:41,663 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-16 12:59:41,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:59:41,847 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:41,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:41,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1191591375, now seen corresponding path program 1 times [2024-11-16 12:59:41,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:59:41,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765625160] [2024-11-16 12:59:41,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:41,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:59:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:59:41,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [891777131] [2024-11-16 12:59:41,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:41,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:59:41,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:59:41,921 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-16 12:59:41,923 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-16 12:59:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:59:42,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:59:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:59:42,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:59:42,225 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:59:42,226 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:59:42,234 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-16 12:59:42,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:59:42,431 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 12:59:42,503 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:59:42,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:59:42 BoogieIcfgContainer [2024-11-16 12:59:42,505 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:59:42,506 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:59:42,506 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:59:42,506 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:59:42,506 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:59:38" (3/4) ... [2024-11-16 12:59:42,508 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:59:42,509 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:59:42,509 INFO L158 Benchmark]: Toolchain (without parser) took 4337.86ms. Allocated memory was 211.8MB in the beginning and 257.9MB in the end (delta: 46.1MB). Free memory was 183.7MB in the beginning and 127.2MB in the end (delta: 56.6MB). Peak memory consumption was 103.3MB. Max. memory is 16.1GB. [2024-11-16 12:59:42,510 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 146.8MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:59:42,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.09ms. Allocated memory is still 211.8MB. Free memory was 183.7MB in the beginning and 167.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 12:59:42,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.94ms. Allocated memory is still 211.8MB. Free memory was 167.6MB in the beginning and 163.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:59:42,510 INFO L158 Benchmark]: Boogie Preprocessor took 44.22ms. Allocated memory is still 211.8MB. Free memory was 163.4MB in the beginning and 157.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 12:59:42,510 INFO L158 Benchmark]: IcfgBuilder took 413.55ms. Allocated memory is still 211.8MB. Free memory was 156.1MB in the beginning and 133.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 12:59:42,511 INFO L158 Benchmark]: TraceAbstraction took 3532.22ms. Allocated memory was 211.8MB in the beginning and 257.9MB in the end (delta: 46.1MB). Free memory was 132.0MB in the beginning and 127.2MB in the end (delta: 4.8MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2024-11-16 12:59:42,511 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 257.9MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:59:42,513 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.17ms. Allocated memory is still 146.8MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.09ms. Allocated memory is still 211.8MB. Free memory was 183.7MB in the beginning and 167.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.94ms. Allocated memory is still 211.8MB. Free memory was 167.6MB in the beginning and 163.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.22ms. Allocated memory is still 211.8MB. Free memory was 163.4MB in the beginning and 157.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 413.55ms. Allocated memory is still 211.8MB. Free memory was 156.1MB in the beginning and 133.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3532.22ms. Allocated memory was 211.8MB in the beginning and 257.9MB in the end (delta: 46.1MB). Free memory was 132.0MB in the beginning and 127.2MB in the end (delta: 4.8MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 257.9MB. Free memory is still 127.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 137, overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of someUnaryDOUBLEoperation at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = 5; [L39] signed short int var_1_29 = 16; [L40] signed char var_1_30 = 2; [L41] unsigned char var_1_31 = 0; [L42] unsigned char var_1_32 = 128; [L43] unsigned long int var_1_33 = 64; [L44] double var_1_34 = 100.375; [L45] unsigned char var_1_35 = 1; [L46] double var_1_36 = 2.4; [L47] unsigned char last_1_var_1_9 = 1; [L48] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=-200, var_1_8=5, var_1_9=1] [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] CALL updateLastVariables() [L133] last_1_var_1_9 = var_1_9 [L134] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=-200, var_1_8=5, var_1_9=1] [L144] RET updateLastVariables() [L145] CALL updateVariables() [L102] var_1_4 = __VERIFIER_nondet_short() [L103] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=5, var_1_9=1] [L103] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=5, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=5, var_1_9=1] [L104] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=5, var_1_9=1] [L105] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=5, var_1_9=1] [L105] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=5, var_1_9=1] [L106] var_1_8 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_9=1] [L107] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_9=1] [L108] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L108] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L109] var_1_10 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L110] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L111] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L111] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L112] var_1_11 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L113] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L114] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L114] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L115] var_1_15 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L116] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L117] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L117] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L118] var_1_20 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L119] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=5, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L120] var_1_28 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L121] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L122] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=128, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L123] var_1_32 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L124] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_32 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L125] RET assume_abort_if_not(var_1_32 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L126] var_1_35 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=64, var_1_34=803/8, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=64, var_1_34=803/8, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L127] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=64, var_1_34=803/8, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L128] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L128] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_36=12/5, var_1_4=2, var_1_8=0, var_1_9=1] [L129] var_1_36 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=1] [L130] RET assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-127, var_1_29=16, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=64, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=1] [L145] RET updateVariables() [L146] CALL step() [L52] var_1_27 = var_1_28 [L53] var_1_29 = 1 [L54] var_1_30 = var_1_28 [L55] var_1_31 = var_1_32 [L56] var_1_33 = 256u VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-127, var_1_28=-127, var_1_29=1, var_1_30=-127, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=1] [L57] COND FALSE !(! var_1_35) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-127, var_1_28=-127, var_1_29=1, var_1_30=-127, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=1] [L62] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L69] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-255, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-127, var_1_28=-127, var_1_29=1, var_1_30=-127, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=1] [L71] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=-255, var_1_10=-255, var_1_11=0, var_1_12=-255, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-127, var_1_28=-127, var_1_29=1, var_1_30=-127, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=1] [L72] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L73] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-255, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-127, var_1_28=-127, var_1_29=1, var_1_30=-127, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=0] [L75] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-255, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=1, var_1_27=-127, var_1_28=-127, var_1_29=1, var_1_30=-127, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=0] [L76] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L79] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-255, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=1, var_1_27=-127, var_1_28=-127, var_1_29=1, var_1_30=-127, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=0] [L81] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=-255, var_1_11=0, var_1_12=-255, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=1, var_1_27=-127, var_1_28=-127, var_1_29=1, var_1_30=-127, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=0] [L82] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=-255, var_1_11=0, var_1_12=-255, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=1, var_1_27=-127, var_1_28=-127, var_1_29=1, var_1_30=-127, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=0] [L85] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-255, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=1, var_1_27=-127, var_1_28=-127, var_1_29=1, var_1_30=-127, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=0] [L89] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L90] var_1_25 = var_1_20 [L91] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=1, var_1_10=-255, var_1_11=0, var_1_12=-255, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=1, var_1_27=-127, var_1_28=-127, var_1_29=1, var_1_30=-127, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=0] [L92] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L93] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-255, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=1, var_1_27=-127, var_1_28=-127, var_1_29=1, var_1_30=-127, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=0] [L97] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-255, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=1, var_1_27=-127, var_1_28=-127, var_1_29=1, var_1_30=-127, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=0] [L146] RET step() [L147] CALL, EXPR property() [L137-L138] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-255, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=1, var_1_27=-127, var_1_28=-127, var_1_29=1, var_1_30=-127, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=0] [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-255, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=1, var_1_27=-127, var_1_28=-127, var_1_29=1, var_1_30=-127, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-255, var_1_15=-255, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=1, var_1_27=-127, var_1_28=-127, var_1_29=1, var_1_30=-127, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=803/8, var_1_35=1, var_1_4=2, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 685 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 346 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 232 IncrementalHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 339 mSDtfsCounter, 232 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 432 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=3, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 57 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 895 NumberOfCodeBlocks, 895 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 761 ConstructedInterpolants, 0 QuantifiedInterpolants, 1380 SizeOfPredicates, 1 NumberOfNonLiveVariables, 319 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 4014/4104 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-16 12:59:42,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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_fillercode_fillercodesize_ps-cn-10_file-40.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 a5c1f731c6afd6eda80ecc2a1a4422b310bbf0b35c642eb8cecc45d271c75d56 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:59:44,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:59:44,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:59:44,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:59:44,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:59:44,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:59:44,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:59:44,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:59:44,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:59:44,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:59:44,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:59:44,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:59:44,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:59:44,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:59:44,368 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:59:44,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:59:44,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:59:44,371 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:59:44,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:59:44,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:59:44,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:59:44,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:59:44,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:59:44,372 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:59:44,372 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:59:44,373 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:59:44,373 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:59:44,373 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:59:44,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:59:44,373 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:59:44,373 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:59:44,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:59:44,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:59:44,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:59:44,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:59:44,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:59:44,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:59:44,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:59:44,374 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:59:44,375 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:59:44,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:59:44,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:59:44,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:59:44,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:59:44,376 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 -> a5c1f731c6afd6eda80ecc2a1a4422b310bbf0b35c642eb8cecc45d271c75d56 [2024-11-16 12:59:44,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:59:44,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:59:44,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:59:44,623 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:59:44,624 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:59:44,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-40.i [2024-11-16 12:59:45,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:59:46,081 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:59:46,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-40.i [2024-11-16 12:59:46,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57d16991c/959a0328fa5b4d06b3846d04db253501/FLAG39207207c [2024-11-16 12:59:46,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57d16991c/959a0328fa5b4d06b3846d04db253501 [2024-11-16 12:59:46,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:59:46,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:59:46,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:59:46,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:59:46,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:59:46,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:59:46" (1/1) ... [2024-11-16 12:59:46,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@daafed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:46, skipping insertion in model container [2024-11-16 12:59:46,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:59:46" (1/1) ... [2024-11-16 12:59:46,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:59:46,294 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_fillercode_fillercodesize_ps-cn-10_file-40.i[915,928] [2024-11-16 12:59:46,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:59:46,370 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:59:46,380 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_fillercode_fillercodesize_ps-cn-10_file-40.i[915,928] [2024-11-16 12:59:46,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:59:46,424 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:59:46,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:46 WrapperNode [2024-11-16 12:59:46,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:59:46,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:59:46,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:59:46,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:59:46,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:46" (1/1) ... [2024-11-16 12:59:46,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:46" (1/1) ... [2024-11-16 12:59:46,468 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-11-16 12:59:46,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:59:46,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:59:46,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:59:46,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:59:46,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:46" (1/1) ... [2024-11-16 12:59:46,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:46" (1/1) ... [2024-11-16 12:59:46,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:46" (1/1) ... [2024-11-16 12:59:46,496 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-16 12:59:46,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:46" (1/1) ... [2024-11-16 12:59:46,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:46" (1/1) ... [2024-11-16 12:59:46,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:46" (1/1) ... [2024-11-16 12:59:46,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:46" (1/1) ... [2024-11-16 12:59:46,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:46" (1/1) ... [2024-11-16 12:59:46,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:46" (1/1) ... [2024-11-16 12:59:46,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:59:46,511 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:59:46,511 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:59:46,511 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:59:46,511 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:46" (1/1) ... [2024-11-16 12:59:46,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:59:46,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:59:46,540 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-16 12:59:46,541 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-16 12:59:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:59:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:59:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:59:46,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:59:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:59:46,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:59:46,642 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:59:46,645 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:59:47,232 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 12:59:47,232 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:59:47,246 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:59:47,248 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:59:47,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:59:47 BoogieIcfgContainer [2024-11-16 12:59:47,249 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:59:47,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:59:47,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:59:47,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:59:47,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:59:46" (1/3) ... [2024-11-16 12:59:47,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d2787a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:59:47, skipping insertion in model container [2024-11-16 12:59:47,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:59:46" (2/3) ... [2024-11-16 12:59:47,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d2787a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:59:47, skipping insertion in model container [2024-11-16 12:59:47,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:59:47" (3/3) ... [2024-11-16 12:59:47,256 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-40.i [2024-11-16 12:59:47,268 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:59:47,269 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:59:47,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:59:47,325 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;@3dce5de7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:59:47,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:59:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-16 12:59:47,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 12:59:47,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:47,340 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:59:47,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:47,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:47,345 INFO L85 PathProgramCache]: Analyzing trace with hash -381125966, now seen corresponding path program 1 times [2024-11-16 12:59:47,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:59:47,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579960481] [2024-11-16 12:59:47,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:47,358 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-16 12:59:47,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:59:47,364 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-16 12:59:47,365 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-16 12:59:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:47,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:59:47,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:59:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-16 12:59:47,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:59:47,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:59:47,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579960481] [2024-11-16 12:59:47,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579960481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:59:47,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:59:47,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:59:47,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587906860] [2024-11-16 12:59:47,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:59:47,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:59:47,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:59:47,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:59:47,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:59:47,685 INFO L87 Difference]: Start difference. First operand has 66 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-16 12:59:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:59:47,711 INFO L93 Difference]: Finished difference Result 124 states and 208 transitions. [2024-11-16 12:59:47,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:59:47,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2024-11-16 12:59:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:59:47,719 INFO L225 Difference]: With dead ends: 124 [2024-11-16 12:59:47,719 INFO L226 Difference]: Without dead ends: 61 [2024-11-16 12:59:47,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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-16 12:59:47,725 INFO L432 NwaCegarLoop]: 89 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, 89 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-16 12:59:47,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:59:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-16 12:59:47,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-16 12:59:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-16 12:59:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2024-11-16 12:59:47,767 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 127 [2024-11-16 12:59:47,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:59:47,768 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2024-11-16 12:59:47,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-16 12:59:47,768 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2024-11-16 12:59:47,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 12:59:47,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:47,774 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:59:47,783 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 (2)] Forceful destruction successful, exit code 0 [2024-11-16 12:59:47,977 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-16 12:59:47,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:47,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:47,978 INFO L85 PathProgramCache]: Analyzing trace with hash 458151218, now seen corresponding path program 1 times [2024-11-16 12:59:47,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:59:47,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718354736] [2024-11-16 12:59:47,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:47,979 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-16 12:59:47,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:59:47,981 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-16 12:59:47,982 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-16 12:59:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:48,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 12:59:48,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:59:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 354 proven. 30 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-16 12:59:48,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:59:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 24 proven. 30 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-16 12:59:48,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:59:48,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718354736] [2024-11-16 12:59:48,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718354736] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:59:48,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 12:59:48,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-16 12:59:48,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494683607] [2024-11-16 12:59:48,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 12:59:48,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:59:48,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:59:48,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:59:48,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:59:48,595 INFO L87 Difference]: Start difference. First operand 61 states and 89 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-16 12:59:48,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:59:48,904 INFO L93 Difference]: Finished difference Result 125 states and 178 transitions. [2024-11-16 12:59:48,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 12:59:48,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 128 [2024-11-16 12:59:48,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:59:48,912 INFO L225 Difference]: With dead ends: 125 [2024-11-16 12:59:48,913 INFO L226 Difference]: Without dead ends: 67 [2024-11-16 12:59:48,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:59:48,914 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 66 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:59:48,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 134 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:59:48,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-16 12:59:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2024-11-16 12:59:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-16 12:59:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2024-11-16 12:59:48,924 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 128 [2024-11-16 12:59:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:59:48,924 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2024-11-16 12:59:48,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-16 12:59:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2024-11-16 12:59:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 12:59:48,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:48,926 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:59:48,944 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 (3)] Ended with exit code 0 [2024-11-16 12:59:49,127 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-16 12:59:49,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:49,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:49,128 INFO L85 PathProgramCache]: Analyzing trace with hash 587233937, now seen corresponding path program 1 times [2024-11-16 12:59:49,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:59:49,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491276515] [2024-11-16 12:59:49,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:49,128 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-16 12:59:49,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:59:49,131 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-16 12:59:49,132 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-16 12:59:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:49,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 12:59:49,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:59:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-16 12:59:49,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:59:49,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:59:49,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491276515] [2024-11-16 12:59:49,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491276515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:59:49,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:59:49,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:59:49,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656116049] [2024-11-16 12:59:49,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:59:49,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:59:49,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:59:49,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:59:49,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:59:49,310 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-16 12:59:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:59:49,420 INFO L93 Difference]: Finished difference Result 123 states and 169 transitions. [2024-11-16 12:59:49,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:59:49,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2024-11-16 12:59:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:59:49,434 INFO L225 Difference]: With dead ends: 123 [2024-11-16 12:59:49,434 INFO L226 Difference]: Without dead ends: 63 [2024-11-16 12:59:49,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 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-16 12:59:49,435 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:59:49,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:59:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-16 12:59:49,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-16 12:59:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-16 12:59:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2024-11-16 12:59:49,441 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 128 [2024-11-16 12:59:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:59:49,442 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2024-11-16 12:59:49,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-16 12:59:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2024-11-16 12:59:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 12:59:49,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:49,443 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:59:49,451 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 (4)] Ended with exit code 0 [2024-11-16 12:59:49,646 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-16 12:59:49,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:49,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:49,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1220220526, now seen corresponding path program 1 times [2024-11-16 12:59:49,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:59:49,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164600718] [2024-11-16 12:59:49,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:49,648 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-16 12:59:49,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:59:49,650 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-16 12:59:49,651 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-16 12:59:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:49,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 12:59:49,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:59:49,979 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-16 12:59:49,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:59:49,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:59:49,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164600718] [2024-11-16 12:59:49,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164600718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:59:49,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:59:49,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:59:49,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883074241] [2024-11-16 12:59:49,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:59:49,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:59:49,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:59:49,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:59:49,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:59:49,981 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-16 12:59:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:59:50,563 INFO L93 Difference]: Finished difference Result 225 states and 306 transitions. [2024-11-16 12:59:50,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 12:59:50,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2024-11-16 12:59:50,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:59:50,569 INFO L225 Difference]: With dead ends: 225 [2024-11-16 12:59:50,569 INFO L226 Difference]: Without dead ends: 165 [2024-11-16 12:59:50,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 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-16 12:59:50,571 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 174 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:59:50,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 289 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:59:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-16 12:59:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 107. [2024-11-16 12:59:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 64 states have internal predecessors, (69), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 12:59:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 145 transitions. [2024-11-16 12:59:50,591 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 145 transitions. Word has length 128 [2024-11-16 12:59:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:59:50,591 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 145 transitions. [2024-11-16 12:59:50,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-16 12:59:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2024-11-16 12:59:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 12:59:50,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:59:50,593 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:59:50,604 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 (5)] Forceful destruction successful, exit code 0 [2024-11-16 12:59:50,794 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-16 12:59:50,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:59:50,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:59:50,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1191591375, now seen corresponding path program 1 times [2024-11-16 12:59:50,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:59:50,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523661840] [2024-11-16 12:59:50,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:59:50,796 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-16 12:59:50,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:59:50,797 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-16 12:59:50,798 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-16 12:59:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:59:50,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 12:59:50,959 INFO L278 TraceCheckSpWp]: Computing forward predicates...