./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_fillercodestructure_filler-pr-ci_file-97.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 84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 20:51:45,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 20:51:45,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 20:51:45,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 20:51:45,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 20:51:45,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 20:51:45,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 20:51:45,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 20:51:45,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 20:51:45,497 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 20:51:45,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 20:51:45,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 20:51:45,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 20:51:45,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 20:51:45,499 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 20:51:45,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 20:51:45,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 20:51:45,499 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 20:51:45,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 20:51:45,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 20:51:45,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 20:51:45,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 20:51:45,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 20:51:45,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 20:51:45,505 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 20:51:45,505 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 20:51:45,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 20:51:45,506 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 20:51:45,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 20:51:45,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 20:51:45,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 20:51:45,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 20:51:45,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:51:45,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 20:51:45,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 20:51:45,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 20:51:45,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 20:51:45,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 20:51:45,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 20:51:45,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 20:51:45,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 20:51:45,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 20:51:45,512 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 -> 84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d [2024-11-18 20:51:45,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 20:51:45,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 20:51:45,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 20:51:45,741 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 20:51:45,741 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 20:51:45,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-11-18 20:51:47,169 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 20:51:47,392 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 20:51:47,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-11-18 20:51:47,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c9455934/1ebec680d8db4ba68f09909f00cddaf3/FLAGf398b8de2 [2024-11-18 20:51:47,416 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c9455934/1ebec680d8db4ba68f09909f00cddaf3 [2024-11-18 20:51:47,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 20:51:47,421 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 20:51:47,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 20:51:47,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 20:51:47,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 20:51:47,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:47" (1/1) ... [2024-11-18 20:51:47,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c7a977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:47, skipping insertion in model container [2024-11-18 20:51:47,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:47" (1/1) ... [2024-11-18 20:51:47,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 20:51:47,592 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_fillercodestructure_filler-pr-ci_file-97.i[919,932] [2024-11-18 20:51:47,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:51:47,689 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 20:51:47,701 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_fillercodestructure_filler-pr-ci_file-97.i[919,932] [2024-11-18 20:51:47,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:51:47,817 INFO L204 MainTranslator]: Completed translation [2024-11-18 20:51:47,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:47 WrapperNode [2024-11-18 20:51:47,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 20:51:47,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 20:51:47,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 20:51:47,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 20:51:47,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:47" (1/1) ... [2024-11-18 20:51:47,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:47" (1/1) ... [2024-11-18 20:51:47,886 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2024-11-18 20:51:47,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 20:51:47,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 20:51:47,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 20:51:47,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 20:51:47,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:47" (1/1) ... [2024-11-18 20:51:47,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:47" (1/1) ... [2024-11-18 20:51:47,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:47" (1/1) ... [2024-11-18 20:51:47,930 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-18 20:51:47,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:47" (1/1) ... [2024-11-18 20:51:47,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:47" (1/1) ... [2024-11-18 20:51:47,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:47" (1/1) ... [2024-11-18 20:51:47,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:47" (1/1) ... [2024-11-18 20:51:47,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:47" (1/1) ... [2024-11-18 20:51:47,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:47" (1/1) ... [2024-11-18 20:51:47,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 20:51:47,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 20:51:47,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 20:51:47,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 20:51:47,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:47" (1/1) ... [2024-11-18 20:51:47,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:51:47,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:51:47,996 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-18 20:51:48,002 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-18 20:51:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 20:51:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 20:51:48,044 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 20:51:48,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 20:51:48,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 20:51:48,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 20:51:48,123 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 20:51:48,125 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 20:51:48,613 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-18 20:51:48,613 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 20:51:48,629 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 20:51:48,632 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 20:51:48,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:48 BoogieIcfgContainer [2024-11-18 20:51:48,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 20:51:48,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 20:51:48,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 20:51:48,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 20:51:48,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:51:47" (1/3) ... [2024-11-18 20:51:48,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8165c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:51:48, skipping insertion in model container [2024-11-18 20:51:48,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:47" (2/3) ... [2024-11-18 20:51:48,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8165c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:51:48, skipping insertion in model container [2024-11-18 20:51:48,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:48" (3/3) ... [2024-11-18 20:51:48,642 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-11-18 20:51:48,657 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 20:51:48,658 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 20:51:48,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 20:51:48,733 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;@3ecfa3c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 20:51:48,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 20:51:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 84 states have internal predecessors, (126), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 20:51:48,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-18 20:51:48,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:51:48,772 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:51:48,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:51:48,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:51:48,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1493245153, now seen corresponding path program 1 times [2024-11-18 20:51:48,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:51:48,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959663446] [2024-11-18 20:51:48,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:51:48,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:51:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:51:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-18 20:51:49,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:51:49,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959663446] [2024-11-18 20:51:49,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959663446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:51:49,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735297297] [2024-11-18 20:51:49,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:51:49,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:51:49,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:51:49,079 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-18 20:51:49,081 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-18 20:51:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:51:49,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 20:51:49,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:51:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-18 20:51:49,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:51:49,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735297297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:51:49,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 20:51:49,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 20:51:49,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257472949] [2024-11-18 20:51:49,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:51:49,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 20:51:49,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:51:49,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 20:51:49,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:51:49,379 INFO L87 Difference]: Start difference. First operand has 106 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 84 states have internal predecessors, (126), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-18 20:51:49,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:51:49,408 INFO L93 Difference]: Finished difference Result 205 states and 346 transitions. [2024-11-18 20:51:49,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 20:51:49,410 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 140 [2024-11-18 20:51:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:51:49,417 INFO L225 Difference]: With dead ends: 205 [2024-11-18 20:51:49,417 INFO L226 Difference]: Without dead ends: 102 [2024-11-18 20:51:49,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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-18 20:51:49,423 INFO L432 NwaCegarLoop]: 157 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, 157 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-18 20:51:49,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:51:49,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-18 20:51:49,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-18 20:51:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.4625) internal successors, (117), 80 states have internal predecessors, (117), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 20:51:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 157 transitions. [2024-11-18 20:51:49,476 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 157 transitions. Word has length 140 [2024-11-18 20:51:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:51:49,477 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 157 transitions. [2024-11-18 20:51:49,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-18 20:51:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 157 transitions. [2024-11-18 20:51:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-18 20:51:49,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:51:49,484 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:51:49,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 20:51:49,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 20:51:49,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:51:49,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:51:49,687 INFO L85 PathProgramCache]: Analyzing trace with hash 810771495, now seen corresponding path program 1 times [2024-11-18 20:51:49,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:51:49,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288128125] [2024-11-18 20:51:49,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:51:49,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:51:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:51:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 20:51:49,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:51:49,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288128125] [2024-11-18 20:51:49,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288128125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:51:49,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:51:49,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 20:51:49,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458303039] [2024-11-18 20:51:49,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:51:49,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 20:51:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:51:49,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 20:51:49,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 20:51:49,898 INFO L87 Difference]: Start difference. First operand 102 states and 157 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 20:51:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:51:49,992 INFO L93 Difference]: Finished difference Result 282 states and 435 transitions. [2024-11-18 20:51:49,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 20:51:49,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-11-18 20:51:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:51:49,995 INFO L225 Difference]: With dead ends: 282 [2024-11-18 20:51:49,995 INFO L226 Difference]: Without dead ends: 183 [2024-11-18 20:51:50,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 20:51:50,001 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 135 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:51:50,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 374 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 20:51:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-18 20:51:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 135. [2024-11-18 20:51:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.4601769911504425) internal successors, (165), 113 states have internal predecessors, (165), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 20:51:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 205 transitions. [2024-11-18 20:51:50,020 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 205 transitions. Word has length 140 [2024-11-18 20:51:50,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:51:50,021 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 205 transitions. [2024-11-18 20:51:50,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 20:51:50,022 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 205 transitions. [2024-11-18 20:51:50,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-18 20:51:50,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:51:50,024 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:51:50,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 20:51:50,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:51:50,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:51:50,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2090525731, now seen corresponding path program 1 times [2024-11-18 20:51:50,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:51:50,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731123337] [2024-11-18 20:51:50,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:51:50,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:51:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:51:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 20:51:50,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:51:50,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731123337] [2024-11-18 20:51:50,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731123337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:51:50,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:51:50,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 20:51:50,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391068064] [2024-11-18 20:51:50,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:51:50,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 20:51:50,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:51:50,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 20:51:50,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:51:50,350 INFO L87 Difference]: Start difference. First operand 135 states and 205 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 20:51:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:51:50,657 INFO L93 Difference]: Finished difference Result 429 states and 656 transitions. [2024-11-18 20:51:50,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 20:51:50,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-11-18 20:51:50,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:51:50,659 INFO L225 Difference]: With dead ends: 429 [2024-11-18 20:51:50,660 INFO L226 Difference]: Without dead ends: 297 [2024-11-18 20:51:50,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-18 20:51:50,661 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 154 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 20:51:50,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 509 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 20:51:50,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-18 20:51:50,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 254. [2024-11-18 20:51:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 211 states have (on average 1.4360189573459716) internal successors, (303), 211 states have internal predecessors, (303), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-18 20:51:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2024-11-18 20:51:50,685 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 140 [2024-11-18 20:51:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:51:50,686 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2024-11-18 20:51:50,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 20:51:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2024-11-18 20:51:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-18 20:51:50,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:51:50,688 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:51:50,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 20:51:50,689 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:51:50,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:51:50,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1312378167, now seen corresponding path program 1 times [2024-11-18 20:51:50,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:51:50,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259597008] [2024-11-18 20:51:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:51:50,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:51:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:51:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 20:51:51,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:51:51,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259597008] [2024-11-18 20:51:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259597008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:51:51,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:51:51,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 20:51:51,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310879461] [2024-11-18 20:51:51,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:51:51,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 20:51:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:51:51,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 20:51:51,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-18 20:51:51,331 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 20:51:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:51:51,869 INFO L93 Difference]: Finished difference Result 658 states and 984 transitions. [2024-11-18 20:51:51,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 20:51:51,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2024-11-18 20:51:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:51:51,873 INFO L225 Difference]: With dead ends: 658 [2024-11-18 20:51:51,873 INFO L226 Difference]: Without dead ends: 407 [2024-11-18 20:51:51,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-18 20:51:51,877 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 248 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 20:51:51,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 574 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 20:51:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-18 20:51:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 383. [2024-11-18 20:51:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 319 states have (on average 1.3918495297805642) internal successors, (444), 319 states have internal predecessors, (444), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-18 20:51:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 564 transitions. [2024-11-18 20:51:51,916 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 564 transitions. Word has length 141 [2024-11-18 20:51:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:51:51,918 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 564 transitions. [2024-11-18 20:51:51,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 20:51:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 564 transitions. [2024-11-18 20:51:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-18 20:51:51,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:51:51,922 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:51:51,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 20:51:51,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:51:51,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:51:51,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1235136882, now seen corresponding path program 1 times [2024-11-18 20:51:51,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:51:51,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527445911] [2024-11-18 20:51:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:51:51,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:51:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:51:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 20:51:52,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:51:52,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527445911] [2024-11-18 20:51:52,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527445911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:51:52,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:51:52,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:51:52,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985363620] [2024-11-18 20:51:52,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:51:52,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:51:52,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:51:52,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:51:52,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:51:52,215 INFO L87 Difference]: Start difference. First operand 383 states and 564 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 20:51:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:51:52,285 INFO L93 Difference]: Finished difference Result 804 states and 1187 transitions. [2024-11-18 20:51:52,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:51:52,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2024-11-18 20:51:52,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:51:52,288 INFO L225 Difference]: With dead ends: 804 [2024-11-18 20:51:52,288 INFO L226 Difference]: Without dead ends: 424 [2024-11-18 20:51:52,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:51:52,290 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 102 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 20:51:52,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 530 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:51:52,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-18 20:51:52,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 383. [2024-11-18 20:51:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 319 states have (on average 1.3667711598746082) internal successors, (436), 319 states have internal predecessors, (436), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-18 20:51:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 556 transitions. [2024-11-18 20:51:52,310 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 556 transitions. Word has length 142 [2024-11-18 20:51:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:51:52,311 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 556 transitions. [2024-11-18 20:51:52,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 20:51:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 556 transitions. [2024-11-18 20:51:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-18 20:51:52,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:51:52,313 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:51:52,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 20:51:52,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:51:52,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:51:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash -685559033, now seen corresponding path program 1 times [2024-11-18 20:51:52,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:51:52,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848859012] [2024-11-18 20:51:52,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:51:52,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:51:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:51:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 20:51:52,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:51:52,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848859012] [2024-11-18 20:51:52,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848859012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:51:52,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:51:52,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 20:51:52,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017935603] [2024-11-18 20:51:52,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:51:52,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 20:51:52,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:51:52,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 20:51:52,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:51:52,540 INFO L87 Difference]: Start difference. First operand 383 states and 556 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 20:51:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:51:52,864 INFO L93 Difference]: Finished difference Result 656 states and 965 transitions. [2024-11-18 20:51:52,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 20:51:52,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-18 20:51:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:51:52,867 INFO L225 Difference]: With dead ends: 656 [2024-11-18 20:51:52,867 INFO L226 Difference]: Without dead ends: 524 [2024-11-18 20:51:52,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 20:51:52,869 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 261 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 20:51:52,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 748 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 20:51:52,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-18 20:51:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 403. [2024-11-18 20:51:52,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 339 states have (on average 1.3775811209439528) internal successors, (467), 339 states have internal predecessors, (467), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-18 20:51:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 587 transitions. [2024-11-18 20:51:52,897 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 587 transitions. Word has length 145 [2024-11-18 20:51:52,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:51:52,897 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 587 transitions. [2024-11-18 20:51:52,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 20:51:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 587 transitions. [2024-11-18 20:51:52,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 20:51:52,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:51:52,899 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:51:52,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 20:51:52,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:51:52,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:51:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1167894651, now seen corresponding path program 1 times [2024-11-18 20:51:52,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:51:52,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446262063] [2024-11-18 20:51:52,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:51:52,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:51:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:51:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 20:51:58,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:51:58,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446262063] [2024-11-18 20:51:58,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446262063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:51:58,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:51:58,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-18 20:51:58,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604615852] [2024-11-18 20:51:58,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:51:58,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 20:51:58,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:51:58,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 20:51:58,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-18 20:51:58,393 INFO L87 Difference]: Start difference. First operand 403 states and 587 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 20:52:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:52:00,808 INFO L93 Difference]: Finished difference Result 1073 states and 1542 transitions. [2024-11-18 20:52:00,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 20:52:00,810 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-11-18 20:52:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:52:00,818 INFO L225 Difference]: With dead ends: 1073 [2024-11-18 20:52:00,818 INFO L226 Difference]: Without dead ends: 802 [2024-11-18 20:52:00,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-18 20:52:00,824 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 205 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-18 20:52:00,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 633 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-18 20:52:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2024-11-18 20:52:00,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 731. [2024-11-18 20:52:00,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 658 states have (on average 1.3920972644376899) internal successors, (916), 661 states have internal predecessors, (916), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-18 20:52:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1048 transitions. [2024-11-18 20:52:00,880 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1048 transitions. Word has length 146 [2024-11-18 20:52:00,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:52:00,880 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1048 transitions. [2024-11-18 20:52:00,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 20:52:00,881 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1048 transitions. [2024-11-18 20:52:00,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 20:52:00,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:52:00,882 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:52:00,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 20:52:00,882 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:52:00,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:52:00,883 INFO L85 PathProgramCache]: Analyzing trace with hash 218308743, now seen corresponding path program 1 times [2024-11-18 20:52:00,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:52:00,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747424184] [2024-11-18 20:52:00,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:52:00,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:52:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 20:52:00,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [371066096] [2024-11-18 20:52:00,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:52:00,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:52:00,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:52:00,947 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-18 20:52:00,950 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-18 20:52:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 20:52:01,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 20:52:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 20:52:01,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 20:52:01,218 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 20:52:01,220 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 20:52:01,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 20:52:01,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-18 20:52:01,426 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:52:01,569 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 20:52:01,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:52:01 BoogieIcfgContainer [2024-11-18 20:52:01,573 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 20:52:01,574 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 20:52:01,575 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 20:52:01,575 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 20:52:01,575 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:48" (3/4) ... [2024-11-18 20:52:01,578 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 20:52:01,579 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 20:52:01,580 INFO L158 Benchmark]: Toolchain (without parser) took 14159.05ms. Allocated memory was 142.6MB in the beginning and 482.3MB in the end (delta: 339.7MB). Free memory was 73.9MB in the beginning and 320.7MB in the end (delta: -246.8MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2024-11-18 20:52:01,580 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 108.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 20:52:01,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.83ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 73.7MB in the beginning and 186.0MB in the end (delta: -112.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-18 20:52:01,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.89ms. Allocated memory is still 218.1MB. Free memory was 186.0MB in the beginning and 183.2MB in the end (delta: 2.7MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-11-18 20:52:01,581 INFO L158 Benchmark]: Boogie Preprocessor took 68.12ms. Allocated memory is still 218.1MB. Free memory was 183.2MB in the beginning and 174.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-18 20:52:01,582 INFO L158 Benchmark]: RCFGBuilder took 676.06ms. Allocated memory is still 218.1MB. Free memory was 174.8MB in the beginning and 139.2MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-18 20:52:01,582 INFO L158 Benchmark]: TraceAbstraction took 12938.94ms. Allocated memory was 218.1MB in the beginning and 482.3MB in the end (delta: 264.2MB). Free memory was 139.2MB in the beginning and 320.7MB in the end (delta: -181.6MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. [2024-11-18 20:52:01,584 INFO L158 Benchmark]: Witness Printer took 4.82ms. Allocated memory is still 482.3MB. Free memory is still 320.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 20:52:01,586 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.14ms. Allocated memory is still 142.6MB. Free memory is still 108.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.83ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 73.7MB in the beginning and 186.0MB in the end (delta: -112.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.89ms. Allocated memory is still 218.1MB. Free memory was 186.0MB in the beginning and 183.2MB in the end (delta: 2.7MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.12ms. Allocated memory is still 218.1MB. Free memory was 183.2MB in the beginning and 174.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 676.06ms. Allocated memory is still 218.1MB. Free memory was 174.8MB in the beginning and 139.2MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12938.94ms. Allocated memory was 218.1MB in the beginning and 482.3MB in the end (delta: 264.2MB). Free memory was 139.2MB in the beginning and 320.7MB in the end (delta: -181.6MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. * Witness Printer took 4.82ms. Allocated memory is still 482.3MB. Free memory is still 320.7MB. 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 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] unsigned short int var_1_29 = 8; [L41] unsigned short int var_1_33 = 48416; [L42] unsigned char var_1_35 = 4; [L43] unsigned long int var_1_37 = 32; [L44] unsigned char var_1_38 = 8; [L45] double var_1_40 = 31.75; [L46] double var_1_41 = 5.5; [L47] signed char var_1_43 = 100; [L48] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0, var_1_9=643/5] [L178] isInitial = 1 [L179] FCALL initially() [L180] COND TRUE 1 [L181] CALL updateLastVariables() [L171] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0, var_1_9=643/5] [L181] RET updateLastVariables() [L182] CALL updateVariables() [L137] var_1_9 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L138] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L139] var_1_10 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L140] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L141] var_1_11 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L142] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L143] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L143] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L144] var_1_12 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L146] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L146] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L147] var_1_13 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L148] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L149] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L149] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L150] var_1_14 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L151] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L152] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L152] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L153] var_1_18 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L154] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L155] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L156] var_1_19 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L157] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L158] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L159] var_1_23 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L160] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L161] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L162] var_1_33 = __VERIFIER_nondet_ushort() [L163] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L163] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L164] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L165] var_1_40 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L166] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L167] var_1_41 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L182] RET updateVariables() [L183] CALL step() [L52] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L55] COND TRUE ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) >= var_1_12 [L56] var_1_37 = var_1_14 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L58] var_1_20 = var_1_8 [L59] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L60] COND TRUE (var_1_20 / var_1_12) < var_1_13 [L61] var_1_29 = var_1_12 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L65] COND FALSE !((var_1_9 * (var_1_40 - var_1_41)) >= var_1_9) [L72] var_1_38 = var_1_13 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L74] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L77] COND FALSE !(\read(var_1_22)) [L82] var_1_24 = ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L84] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L87] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L88] COND FALSE !(\read(var_1_22)) [L95] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L97] COND FALSE !(((((var_1_10) > (64.75f)) ? (var_1_10) : (64.75f))) <= var_1_40) [L104] var_1_43 = var_1_13 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L106] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L107] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L108] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L109] COND FALSE !(\read(var_1_22)) [L116] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L121] signed long int stepLocal_4 = 256; [L122] unsigned char stepLocal_3 = var_1_22; [L123] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L124] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L127] COND FALSE !(stepLocal_3 || var_1_22) [L132] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L183] RET step() [L184] CALL, EXPR property() [L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174-L175] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L184] RET, EXPR property() [L184] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 8, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1105 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1105 mSDsluCounter, 3525 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2128 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1403 IncrementalHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 1397 mSDtfsCounter, 1403 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=731occurred in iteration=7, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 348 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1426 NumberOfCodeBlocks, 1426 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1126 ConstructedInterpolants, 0 QuantifiedInterpolants, 11173 SizeOfPredicates, 0 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 6042/6080 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-18 20:52:01,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.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 84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 20:52:04,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 20:52:04,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 20:52:04,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 20:52:04,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 20:52:04,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 20:52:04,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 20:52:04,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 20:52:04,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 20:52:04,219 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 20:52:04,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 20:52:04,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 20:52:04,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 20:52:04,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 20:52:04,223 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 20:52:04,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 20:52:04,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 20:52:04,224 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 20:52:04,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 20:52:04,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 20:52:04,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 20:52:04,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 20:52:04,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 20:52:04,226 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 20:52:04,226 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 20:52:04,226 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 20:52:04,226 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 20:52:04,226 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 20:52:04,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 20:52:04,227 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 20:52:04,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 20:52:04,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 20:52:04,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 20:52:04,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 20:52:04,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:52:04,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 20:52:04,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 20:52:04,233 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 20:52:04,233 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 20:52:04,233 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 20:52:04,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 20:52:04,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 20:52:04,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 20:52:04,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 20:52:04,235 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 -> 84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d [2024-11-18 20:52:04,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 20:52:04,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 20:52:04,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 20:52:04,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 20:52:04,534 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 20:52:04,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-11-18 20:52:05,975 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 20:52:06,160 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 20:52:06,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-11-18 20:52:06,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d200695e0/c82ab5714d8a478295d4e47612769d32/FLAG30cb558a2 [2024-11-18 20:52:06,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d200695e0/c82ab5714d8a478295d4e47612769d32 [2024-11-18 20:52:06,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 20:52:06,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 20:52:06,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 20:52:06,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 20:52:06,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 20:52:06,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:52:06" (1/1) ... [2024-11-18 20:52:06,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2836e337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:06, skipping insertion in model container [2024-11-18 20:52:06,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:52:06" (1/1) ... [2024-11-18 20:52:06,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 20:52:06,443 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_fillercodestructure_filler-pr-ci_file-97.i[919,932] [2024-11-18 20:52:06,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:52:06,561 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 20:52:06,571 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_fillercodestructure_filler-pr-ci_file-97.i[919,932] [2024-11-18 20:52:06,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:52:06,640 INFO L204 MainTranslator]: Completed translation [2024-11-18 20:52:06,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:06 WrapperNode [2024-11-18 20:52:06,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 20:52:06,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 20:52:06,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 20:52:06,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 20:52:06,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:06" (1/1) ... [2024-11-18 20:52:06,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:06" (1/1) ... [2024-11-18 20:52:06,698 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-11-18 20:52:06,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 20:52:06,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 20:52:06,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 20:52:06,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 20:52:06,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:06" (1/1) ... [2024-11-18 20:52:06,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:06" (1/1) ... [2024-11-18 20:52:06,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:06" (1/1) ... [2024-11-18 20:52:06,737 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-18 20:52:06,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:06" (1/1) ... [2024-11-18 20:52:06,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:06" (1/1) ... [2024-11-18 20:52:06,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:06" (1/1) ... [2024-11-18 20:52:06,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:06" (1/1) ... [2024-11-18 20:52:06,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:06" (1/1) ... [2024-11-18 20:52:06,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:06" (1/1) ... [2024-11-18 20:52:06,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 20:52:06,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 20:52:06,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 20:52:06,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 20:52:06,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:06" (1/1) ... [2024-11-18 20:52:06,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:52:06,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:52:06,814 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-18 20:52:06,821 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-18 20:52:06,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 20:52:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 20:52:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 20:52:06,863 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 20:52:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 20:52:06,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 20:52:06,944 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 20:52:06,946 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 20:52:13,263 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-18 20:52:13,263 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 20:52:13,277 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 20:52:13,278 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 20:52:13,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:52:13 BoogieIcfgContainer [2024-11-18 20:52:13,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 20:52:13,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 20:52:13,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 20:52:13,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 20:52:13,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:52:06" (1/3) ... [2024-11-18 20:52:13,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754a7350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:52:13, skipping insertion in model container [2024-11-18 20:52:13,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:06" (2/3) ... [2024-11-18 20:52:13,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754a7350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:52:13, skipping insertion in model container [2024-11-18 20:52:13,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:52:13" (3/3) ... [2024-11-18 20:52:13,289 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-11-18 20:52:13,302 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 20:52:13,302 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 20:52:13,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 20:52:13,366 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;@28841d9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 20:52:13,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 20:52:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 20:52:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-18 20:52:13,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:52:13,389 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:52:13,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:52:13,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:52:13,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2060441151, now seen corresponding path program 1 times [2024-11-18 20:52:13,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:52:13,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64105951] [2024-11-18 20:52:13,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:52:13,409 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-18 20:52:13,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:52:13,413 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-18 20:52:13,421 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-18 20:52:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:52:13,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 20:52:13,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:52:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-18 20:52:13,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:52:13,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:52:13,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64105951] [2024-11-18 20:52:13,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64105951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:52:13,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:52:13,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 20:52:13,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303778304] [2024-11-18 20:52:13,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:52:13,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 20:52:13,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:52:13,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 20:52:13,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:52:13,890 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-18 20:52:13,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:52:13,918 INFO L93 Difference]: Finished difference Result 143 states and 248 transitions. [2024-11-18 20:52:13,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 20:52:13,920 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 136 [2024-11-18 20:52:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:52:13,927 INFO L225 Difference]: With dead ends: 143 [2024-11-18 20:52:13,928 INFO L226 Difference]: Without dead ends: 71 [2024-11-18 20:52:13,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-18 20:52:13,936 INFO L432 NwaCegarLoop]: 109 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, 109 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-18 20:52:13,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:52:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-18 20:52:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-18 20:52:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 20:52:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 109 transitions. [2024-11-18 20:52:13,984 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 109 transitions. Word has length 136 [2024-11-18 20:52:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:52:13,985 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 109 transitions. [2024-11-18 20:52:13,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-18 20:52:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 109 transitions. [2024-11-18 20:52:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-18 20:52:13,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:52:13,989 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:52:14,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 20:52:14,194 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-18 20:52:14,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:52:14,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:52:14,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1195479351, now seen corresponding path program 1 times [2024-11-18 20:52:14,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:52:14,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854535706] [2024-11-18 20:52:14,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:52:14,197 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-18 20:52:14,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:52:14,200 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-18 20:52:14,219 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-18 20:52:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:52:14,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 20:52:14,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:52:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 289 proven. 12 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-18 20:52:15,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:52:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-18 20:52:16,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:52:16,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854535706] [2024-11-18 20:52:16,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854535706] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 20:52:16,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 20:52:16,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-18 20:52:16,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924454523] [2024-11-18 20:52:16,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 20:52:16,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 20:52:16,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:52:16,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 20:52:16,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-18 20:52:16,081 INFO L87 Difference]: Start difference. First operand 71 states and 109 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-18 20:52:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:52:17,614 INFO L93 Difference]: Finished difference Result 144 states and 216 transitions. [2024-11-18 20:52:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 20:52:17,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 136 [2024-11-18 20:52:17,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:52:17,616 INFO L225 Difference]: With dead ends: 144 [2024-11-18 20:52:17,617 INFO L226 Difference]: Without dead ends: 76 [2024-11-18 20:52:17,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-18 20:52:17,618 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 111 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-18 20:52:17,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 157 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-18 20:52:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-18 20:52:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2024-11-18 20:52:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 20:52:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2024-11-18 20:52:17,631 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 136 [2024-11-18 20:52:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:52:17,631 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2024-11-18 20:52:17,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-18 20:52:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2024-11-18 20:52:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-18 20:52:17,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:52:17,634 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:52:17,645 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-18 20:52:17,838 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-18 20:52:17,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:52:17,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:52:17,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1948431163, now seen corresponding path program 1 times [2024-11-18 20:52:17,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:52:17,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261528376] [2024-11-18 20:52:17,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:52:17,841 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-18 20:52:17,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:52:17,843 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-18 20:52:17,845 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-18 20:52:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:52:18,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 20:52:18,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:52:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 20:52:19,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:52:19,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:52:19,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261528376] [2024-11-18 20:52:19,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261528376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:52:19,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:52:19,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:52:19,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669080520] [2024-11-18 20:52:19,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:52:19,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 20:52:19,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:52:19,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 20:52:19,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:52:19,579 INFO L87 Difference]: Start difference. First operand 72 states and 101 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 20:52:20,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:52:20,466 INFO L93 Difference]: Finished difference Result 186 states and 264 transitions. [2024-11-18 20:52:20,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 20:52:20,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-11-18 20:52:20,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:52:20,468 INFO L225 Difference]: With dead ends: 186 [2024-11-18 20:52:20,468 INFO L226 Difference]: Without dead ends: 117 [2024-11-18 20:52:20,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-18 20:52:20,470 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 86 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 20:52:20,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 315 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 20:52:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-18 20:52:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 72. [2024-11-18 20:52:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 20:52:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2024-11-18 20:52:20,486 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 99 transitions. Word has length 136 [2024-11-18 20:52:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:52:20,486 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 99 transitions. [2024-11-18 20:52:20,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 20:52:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2024-11-18 20:52:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-18 20:52:20,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:52:20,488 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:52:20,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-18 20:52:20,689 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-18 20:52:20,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:52:20,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:52:20,691 INFO L85 PathProgramCache]: Analyzing trace with hash 856281452, now seen corresponding path program 1 times [2024-11-18 20:52:20,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:52:20,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101542269] [2024-11-18 20:52:20,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:52:20,692 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-18 20:52:20,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:52:20,693 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-18 20:52:20,695 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-18 20:52:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:52:21,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 20:52:21,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:52:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 20:52:23,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:52:23,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:52:23,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101542269] [2024-11-18 20:52:23,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101542269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:52:23,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:52:23,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:52:23,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158742982] [2024-11-18 20:52:23,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:52:23,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 20:52:23,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:52:23,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 20:52:23,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:52:23,834 INFO L87 Difference]: Start difference. First operand 72 states and 99 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 20:52:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:52:24,488 INFO L93 Difference]: Finished difference Result 217 states and 298 transitions. [2024-11-18 20:52:24,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 20:52:24,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-18 20:52:24,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:52:24,490 INFO L225 Difference]: With dead ends: 217 [2024-11-18 20:52:24,490 INFO L226 Difference]: Without dead ends: 148 [2024-11-18 20:52:24,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 20:52:24,491 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 72 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 20:52:24,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 307 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 20:52:24,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-18 20:52:24,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2024-11-18 20:52:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.202127659574468) internal successors, (113), 94 states have internal predecessors, (113), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-18 20:52:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 193 transitions. [2024-11-18 20:52:24,538 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 193 transitions. Word has length 137 [2024-11-18 20:52:24,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:52:24,542 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 193 transitions. [2024-11-18 20:52:24,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 20:52:24,542 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 193 transitions. [2024-11-18 20:52:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-18 20:52:24,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:52:24,544 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:52:24,559 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-18 20:52:24,746 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-18 20:52:24,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:52:24,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:52:24,747 INFO L85 PathProgramCache]: Analyzing trace with hash 830270148, now seen corresponding path program 1 times [2024-11-18 20:52:24,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:52:24,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421131943] [2024-11-18 20:52:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:52:24,748 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-18 20:52:24,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:52:24,751 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-18 20:52:24,752 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-18 20:52:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:52:25,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-18 20:52:25,170 INFO L278 TraceCheckSpWp]: Computing forward predicates...