./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_codestructure_normal_file-78.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 e02387555c4e85b27c0d96305641a888bd9021ec1e0e518b9819057955f97970 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:39:22,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:39:22,797 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:39:22,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:39:22,804 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:39:22,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:39:22,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:39:22,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:39:22,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:39:22,832 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:39:22,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:39:22,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:39:22,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:39:22,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:39:22,851 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:39:22,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:39:22,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:39:22,852 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:39:22,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:39:22,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:39:22,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:39:22,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:39:22,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:39:22,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:39:22,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:39:22,859 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:39:22,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:39:22,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:39:22,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:39:22,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:39:22,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:39:22,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:39:22,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:39:22,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:39:22,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:39:22,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:39:22,862 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:39:22,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:39:22,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:39:22,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:39:22,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:39:22,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:39:22,863 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 -> e02387555c4e85b27c0d96305641a888bd9021ec1e0e518b9819057955f97970 [2024-11-08 19:39:23,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:39:23,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:39:23,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:39:23,108 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:39:23,108 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:39:23,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-78.i [2024-11-08 19:39:24,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:39:24,683 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:39:24,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-78.i [2024-11-08 19:39:24,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59dbf85e/b5d8a70dc82a43a7862f0392a69492f5/FLAG76480f3a6 [2024-11-08 19:39:25,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59dbf85e/b5d8a70dc82a43a7862f0392a69492f5 [2024-11-08 19:39:25,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:39:25,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:39:25,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:39:25,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:39:25,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:39:25,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:39:25" (1/1) ... [2024-11-08 19:39:25,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5897df62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:25, skipping insertion in model container [2024-11-08 19:39:25,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:39:25" (1/1) ... [2024-11-08 19:39:25,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:39:25,192 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_codestructure_normal_file-78.i[913,926] [2024-11-08 19:39:25,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:39:25,248 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:39:25,256 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_codestructure_normal_file-78.i[913,926] [2024-11-08 19:39:25,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:39:25,296 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:39:25,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:25 WrapperNode [2024-11-08 19:39:25,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:39:25,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:39:25,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:39:25,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:39:25,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:25" (1/1) ... [2024-11-08 19:39:25,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:25" (1/1) ... [2024-11-08 19:39:25,387 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-11-08 19:39:25,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:39:25,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:39:25,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:39:25,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:39:25,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:25" (1/1) ... [2024-11-08 19:39:25,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:25" (1/1) ... [2024-11-08 19:39:25,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:25" (1/1) ... [2024-11-08 19:39:25,446 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-08 19:39:25,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:25" (1/1) ... [2024-11-08 19:39:25,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:25" (1/1) ... [2024-11-08 19:39:25,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:25" (1/1) ... [2024-11-08 19:39:25,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:25" (1/1) ... [2024-11-08 19:39:25,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:25" (1/1) ... [2024-11-08 19:39:25,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:25" (1/1) ... [2024-11-08 19:39:25,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:39:25,497 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:39:25,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:39:25,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:39:25,498 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:25" (1/1) ... [2024-11-08 19:39:25,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:39:25,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:39:25,530 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-08 19:39:25,532 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-08 19:39:25,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:39:25,582 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:39:25,582 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:39:25,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:39:25,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:39:25,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:39:25,653 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:39:25,655 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:39:26,003 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-08 19:39:26,003 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:39:26,026 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:39:26,027 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:39:26,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:39:26 BoogieIcfgContainer [2024-11-08 19:39:26,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:39:26,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:39:26,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:39:26,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:39:26,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:39:25" (1/3) ... [2024-11-08 19:39:26,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e8c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:39:26, skipping insertion in model container [2024-11-08 19:39:26,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:25" (2/3) ... [2024-11-08 19:39:26,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e8c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:39:26, skipping insertion in model container [2024-11-08 19:39:26,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:39:26" (3/3) ... [2024-11-08 19:39:26,039 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-78.i [2024-11-08 19:39:26,051 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:39:26,052 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:39:26,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:39:26,111 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;@71ba4d78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:39:26,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:39:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:39:26,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 19:39:26,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:39:26,130 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:39:26,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:39:26,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:39:26,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1166131645, now seen corresponding path program 1 times [2024-11-08 19:39:26,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:39:26,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723744321] [2024-11-08 19:39:26,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:39:26,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:39:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:39:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:39:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:39:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:39:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:39:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:39:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:39:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:39:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:39:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:39:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:39:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:39:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:39:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 19:39:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:39:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:39:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:39:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:39:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:39:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:39:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:39:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:26,786 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 19:39:26,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:39:26,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723744321] [2024-11-08 19:39:26,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723744321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:39:26,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:39:26,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:39:26,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031992065] [2024-11-08 19:39:26,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:39:26,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:39:26,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:39:26,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:39:26,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:39:26,812 INFO L87 Difference]: Start difference. First operand has 82 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 19:39:26,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:39:26,961 INFO L93 Difference]: Finished difference Result 192 states and 324 transitions. [2024-11-08 19:39:26,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:39:26,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-11-08 19:39:26,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:39:26,972 INFO L225 Difference]: With dead ends: 192 [2024-11-08 19:39:26,975 INFO L226 Difference]: Without dead ends: 113 [2024-11-08 19:39:26,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:39:26,981 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 104 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:39:26,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 193 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:39:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-08 19:39:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 96. [2024-11-08 19:39:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:39:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2024-11-08 19:39:27,015 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 147 transitions. Word has length 144 [2024-11-08 19:39:27,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:39:27,017 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 147 transitions. [2024-11-08 19:39:27,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 19:39:27,017 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 147 transitions. [2024-11-08 19:39:27,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 19:39:27,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:39:27,019 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:39:27,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:39:27,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:39:27,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:39:27,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2107767297, now seen corresponding path program 1 times [2024-11-08 19:39:27,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:39:27,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014488759] [2024-11-08 19:39:27,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:39:27,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:39:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:39:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:39:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:39:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:39:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:39:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:39:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:39:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:39:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:39:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:39:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:39:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:39:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:39:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 19:39:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:39:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:39:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:39:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:39:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:39:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:39:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:39:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 19:39:27,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:39:27,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014488759] [2024-11-08 19:39:27,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014488759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:39:27,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:39:27,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:39:27,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453075897] [2024-11-08 19:39:27,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:39:27,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:39:27,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:39:27,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:39:27,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:39:27,435 INFO L87 Difference]: Start difference. First operand 96 states and 147 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 19:39:27,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:39:27,556 INFO L93 Difference]: Finished difference Result 188 states and 289 transitions. [2024-11-08 19:39:27,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:39:27,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-11-08 19:39:27,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:39:27,561 INFO L225 Difference]: With dead ends: 188 [2024-11-08 19:39:27,561 INFO L226 Difference]: Without dead ends: 95 [2024-11-08 19:39:27,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:39:27,563 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 90 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:39:27,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 225 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:39:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-08 19:39:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-11-08 19:39:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.391304347826087) internal successors, (96), 69 states have internal predecessors, (96), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:39:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 140 transitions. [2024-11-08 19:39:27,576 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 140 transitions. Word has length 144 [2024-11-08 19:39:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:39:27,576 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 140 transitions. [2024-11-08 19:39:27,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 19:39:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 140 transitions. [2024-11-08 19:39:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 19:39:27,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:39:27,578 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:39:27,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:39:27,578 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:39:27,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:39:27,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1546135556, now seen corresponding path program 1 times [2024-11-08 19:39:27,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:39:27,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126413136] [2024-11-08 19:39:27,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:39:27,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:39:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:39:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:39:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:39:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:39:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:39:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:39:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:39:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:39:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:39:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:39:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:39:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:39:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:39:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 19:39:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:39:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:39:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:39:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:39:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:39:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:39:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:39:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,750 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 19:39:27,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:39:27,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126413136] [2024-11-08 19:39:27,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126413136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:39:27,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:39:27,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:39:27,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134868884] [2024-11-08 19:39:27,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:39:27,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:39:27,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:39:27,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:39:27,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:39:27,754 INFO L87 Difference]: Start difference. First operand 93 states and 140 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 19:39:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:39:27,892 INFO L93 Difference]: Finished difference Result 186 states and 281 transitions. [2024-11-08 19:39:27,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:39:27,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-11-08 19:39:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:39:27,894 INFO L225 Difference]: With dead ends: 186 [2024-11-08 19:39:27,894 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 19:39:27,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-08 19:39:27,899 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 52 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:39:27,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 229 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:39:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 19:39:27,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2024-11-08 19:39:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:39:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 141 transitions. [2024-11-08 19:39:27,912 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 141 transitions. Word has length 146 [2024-11-08 19:39:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:39:27,913 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 141 transitions. [2024-11-08 19:39:27,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 19:39:27,913 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2024-11-08 19:39:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 19:39:27,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:39:27,914 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:39:27,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:39:27,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:39:27,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:39:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1385247276, now seen corresponding path program 1 times [2024-11-08 19:39:27,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:39:27,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450944564] [2024-11-08 19:39:27,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:39:27,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:39:27,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633021385] [2024-11-08 19:39:27,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:39:27,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:39:27,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:39:27,990 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-08 19:39:27,991 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-08 19:39:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:39:28,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:39:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:39:28,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:39:28,229 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:39:28,230 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:39:28,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 19:39:28,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:39:28,438 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 19:39:28,529 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:39:28,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:39:28 BoogieIcfgContainer [2024-11-08 19:39:28,536 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:39:28,536 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:39:28,537 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:39:28,537 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:39:28,538 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:39:26" (3/4) ... [2024-11-08 19:39:28,540 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:39:28,541 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:39:28,542 INFO L158 Benchmark]: Toolchain (without parser) took 3507.40ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 82.1MB in the beginning and 109.4MB in the end (delta: -27.3MB). Peak memory consumption was 88.2MB. Max. memory is 16.1GB. [2024-11-08 19:39:28,543 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:39:28,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.54ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 64.9MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:39:28,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.05ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 64.9MB in the beginning and 234.3MB in the end (delta: -169.4MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-11-08 19:39:28,543 INFO L158 Benchmark]: Boogie Preprocessor took 107.79ms. Allocated memory is still 270.5MB. Free memory was 234.3MB in the beginning and 227.8MB in the end (delta: 6.6MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2024-11-08 19:39:28,544 INFO L158 Benchmark]: RCFGBuilder took 530.33ms. Allocated memory is still 270.5MB. Free memory was 226.7MB in the beginning and 196.3MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 19:39:28,545 INFO L158 Benchmark]: TraceAbstraction took 2504.57ms. Allocated memory is still 270.5MB. Free memory was 196.3MB in the beginning and 109.4MB in the end (delta: 86.9MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2024-11-08 19:39:28,545 INFO L158 Benchmark]: Witness Printer took 4.77ms. Allocated memory is still 270.5MB. Free memory is still 109.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:39:28,546 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 155.2MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.54ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 64.9MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.05ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 64.9MB in the beginning and 234.3MB in the end (delta: -169.4MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.79ms. Allocated memory is still 270.5MB. Free memory was 234.3MB in the beginning and 227.8MB in the end (delta: 6.6MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * RCFGBuilder took 530.33ms. Allocated memory is still 270.5MB. Free memory was 226.7MB in the beginning and 196.3MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2504.57ms. Allocated memory is still 270.5MB. Free memory was 196.3MB in the beginning and 109.4MB in the end (delta: 86.9MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. * Witness Printer took 4.77ms. Allocated memory is still 270.5MB. Free memory is still 109.4MB. 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 someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryArithmeticDOUBLEoperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] signed long int var_1_2 = 0; [L24] unsigned char var_1_3 = 64; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 2; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 8; [L29] double var_1_8 = 1.875; [L30] signed long int var_1_9 = -4; [L31] double var_1_10 = 63.5; [L32] double var_1_11 = 255.375; [L33] double var_1_12 = 999999999.525; [L34] double var_1_13 = 63.75; [L35] double var_1_14 = 0.625; [L36] unsigned short int var_1_15 = 5; [L37] signed char var_1_16 = 4; [L38] signed char var_1_17 = 0; [L39] signed char var_1_18 = -2; [L40] signed char var_1_19 = 1; [L41] unsigned short int var_1_20 = 50; [L42] unsigned short int var_1_21 = 0; VAL [isInitial=0, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L117] isInitial = 1 [L118] FCALL initially() [L119] COND TRUE 1 [L120] FCALL updateLastVariables() [L121] CALL updateVariables() [L74] var_1_2 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_2 >= -2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L75] RET assume_abort_if_not(var_1_2 >= -2147483646) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L76] CALL assume_abort_if_not(var_1_2 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L76] RET assume_abort_if_not(var_1_2 <= 2147483646) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L77] var_1_4 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L79] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L79] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L80] var_1_5 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L82] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L82] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L83] var_1_7 = __VERIFIER_nondet_ushort() [L84] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L84] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L85] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=-4] [L85] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=-4] [L86] var_1_9 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L87] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L88] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L88] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L89] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L89] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L90] var_1_10 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L91] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L92] var_1_11 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L93] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L94] var_1_12 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L95] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L96] var_1_13 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L97] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L98] var_1_14 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L99] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L100] var_1_17 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L101] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L102] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L102] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L103] var_1_18 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L104] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L105] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L105] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L106] var_1_19 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L107] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L108] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L108] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L121] RET updateVariables() [L122] CALL step() [L46] var_1_1 = ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L47] COND FALSE !(var_1_1 < var_1_2) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L50] EXPR var_1_2 ^ var_1_1 VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L50] COND FALSE !((var_1_2 ^ var_1_1) < -256) [L53] COND TRUE var_1_5 <= 50 [L54] var_1_6 = var_1_3 VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=64, var_1_7=0, var_1_8=15/8, var_1_9=32] [L57] COND TRUE var_1_1 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L58] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=64, var_1_7=0, var_1_9=32] [L64] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_1 [L65] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, var_1_15=66, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=64, var_1_7=0, var_1_9=32] [L67] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L68] var_1_20 = (((((var_1_5 + var_1_3)) > (var_1_4)) ? ((var_1_5 + var_1_3)) : (var_1_4))) VAL [isInitial=1, var_1_15=66, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=65, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=64, var_1_7=0, var_1_9=32] [L69] EXPR (var_1_2 * var_1_17) & (var_1_15 * var_1_18) VAL [isInitial=1, var_1_15=66, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=65, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=64, var_1_7=0, var_1_9=32] [L69] COND TRUE var_1_16 == ((var_1_2 * var_1_17) & (var_1_15 * var_1_18)) [L70] var_1_21 = (var_1_4 + 128) VAL [isInitial=1, var_1_15=66, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=65, var_1_21=193, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=64, var_1_7=0, var_1_9=32] [L122] RET step() [L123] CALL, EXPR property() [L113] EXPR ((var_1_1 == ((signed long int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) && ((var_1_1 < var_1_2) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((var_1_2 ^ var_1_1) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) var_1_3)) : 1)) VAL [isInitial=1, var_1_15=66, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=65, var_1_21=193, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=64, var_1_7=0, var_1_9=32] [L113] EXPR var_1_2 ^ var_1_1 VAL [isInitial=1, var_1_15=66, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=65, var_1_21=193, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=64, var_1_7=0, var_1_9=32] [L113] EXPR ((var_1_1 == ((signed long int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) && ((var_1_1 < var_1_2) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((var_1_2 ^ var_1_1) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) var_1_3)) : 1)) VAL [isInitial=1, var_1_15=66, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=65, var_1_21=193, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=64, var_1_7=0, var_1_9=32] [L113] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) && ((var_1_1 < var_1_2) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((var_1_2 ^ var_1_1) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) var_1_3)) : 1))) && ((var_1_1 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_1) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_3)) > (var_1_4)) ? ((var_1_5 + var_1_3)) : (var_1_4)))))) && ((var_1_16 == ((var_1_2 * var_1_17) & (var_1_15 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, var_1_15=66, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=65, var_1_21=193, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=64, var_1_7=0, var_1_9=32] [L113-L114] return (((((((var_1_1 == ((signed long int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) && ((var_1_1 < var_1_2) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((var_1_2 ^ var_1_1) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) var_1_3)) : 1))) && ((var_1_1 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_1) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_3)) > (var_1_4)) ? ((var_1_5 + var_1_3)) : (var_1_4)))))) && ((var_1_16 == ((var_1_2 * var_1_17) & (var_1_15 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_15=66, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=65, var_1_21=193, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=64, var_1_7=0, var_1_9=32] [L19] reach_error() VAL [isInitial=1, var_1_15=66, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=65, var_1_21=193, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=-255, var_1_6=64, var_1_7=0, var_1_9=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 246 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 246 mSDsluCounter, 647 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 364 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 232 IncrementalHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 283 mSDtfsCounter, 232 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=1, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 21 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 728 NumberOfCodeBlocks, 728 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 675 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2772/2772 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-08 19:39:28,568 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_codestructure_normal_file-78.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 e02387555c4e85b27c0d96305641a888bd9021ec1e0e518b9819057955f97970 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:39:30,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:39:30,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:39:30,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:39:30,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:39:30,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:39:30,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:39:30,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:39:30,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:39:30,587 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:39:30,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:39:30,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:39:30,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:39:30,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:39:30,588 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:39:30,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:39:30,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:39:30,589 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:39:30,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:39:30,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:39:30,590 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:39:30,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:39:30,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:39:30,592 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:39:30,592 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:39:30,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:39:30,593 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:39:30,593 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:39:30,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:39:30,593 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:39:30,594 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:39:30,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:39:30,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:39:30,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:39:30,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:39:30,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:39:30,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:39:30,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:39:30,595 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:39:30,595 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:39:30,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:39:30,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:39:30,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:39:30,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:39:30,596 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 -> e02387555c4e85b27c0d96305641a888bd9021ec1e0e518b9819057955f97970 [2024-11-08 19:39:30,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:39:30,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:39:30,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:39:30,881 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:39:30,882 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:39:30,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-78.i [2024-11-08 19:39:32,239 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:39:32,448 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:39:32,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-78.i [2024-11-08 19:39:32,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d744bef62/f74722d3b7d34c9d87b84cb332b9dd80/FLAG696237f27 [2024-11-08 19:39:32,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d744bef62/f74722d3b7d34c9d87b84cb332b9dd80 [2024-11-08 19:39:32,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:39:32,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:39:32,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:39:32,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:39:32,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:39:32,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:39:32" (1/1) ... [2024-11-08 19:39:32,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a1b61ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:32, skipping insertion in model container [2024-11-08 19:39:32,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:39:32" (1/1) ... [2024-11-08 19:39:32,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:39:32,660 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_codestructure_normal_file-78.i[913,926] [2024-11-08 19:39:32,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:39:32,730 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:39:32,753 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_codestructure_normal_file-78.i[913,926] [2024-11-08 19:39:32,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:39:32,796 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:39:32,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:32 WrapperNode [2024-11-08 19:39:32,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:39:32,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:39:32,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:39:32,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:39:32,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:32" (1/1) ... [2024-11-08 19:39:32,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:32" (1/1) ... [2024-11-08 19:39:32,833 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-08 19:39:32,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:39:32,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:39:32,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:39:32,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:39:32,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:32" (1/1) ... [2024-11-08 19:39:32,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:32" (1/1) ... [2024-11-08 19:39:32,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:32" (1/1) ... [2024-11-08 19:39:32,855 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-08 19:39:32,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:32" (1/1) ... [2024-11-08 19:39:32,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:32" (1/1) ... [2024-11-08 19:39:32,862 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:32" (1/1) ... [2024-11-08 19:39:32,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:32" (1/1) ... [2024-11-08 19:39:32,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:32" (1/1) ... [2024-11-08 19:39:32,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:32" (1/1) ... [2024-11-08 19:39:32,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:39:32,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:39:32,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:39:32,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:39:32,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:32" (1/1) ... [2024-11-08 19:39:32,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:39:32,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:39:32,906 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-08 19:39:32,908 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-08 19:39:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:39:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:39:32,937 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:39:32,938 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:39:32,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:39:32,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:39:32,995 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:39:32,996 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:39:38,145 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:39:38,146 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:39:38,156 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:39:38,156 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:39:38,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:39:38 BoogieIcfgContainer [2024-11-08 19:39:38,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:39:38,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:39:38,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:39:38,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:39:38,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:39:32" (1/3) ... [2024-11-08 19:39:38,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423f0b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:39:38, skipping insertion in model container [2024-11-08 19:39:38,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:32" (2/3) ... [2024-11-08 19:39:38,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423f0b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:39:38, skipping insertion in model container [2024-11-08 19:39:38,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:39:38" (3/3) ... [2024-11-08 19:39:38,163 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-78.i [2024-11-08 19:39:38,175 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:39:38,175 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:39:38,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:39:38,239 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;@45486192, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:39:38,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:39:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:39:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 19:39:38,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:39:38,252 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:39:38,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:39:38,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:39:38,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1978906309, now seen corresponding path program 1 times [2024-11-08 19:39:38,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:39:38,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163394852] [2024-11-08 19:39:38,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:39:38,269 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-08 19:39:38,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:39:38,272 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-08 19:39:38,285 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-08 19:39:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:38,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:39:38,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:39:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-08 19:39:38,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:39:38,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:39:38,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163394852] [2024-11-08 19:39:38,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163394852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:39:38,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:39:38,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:39:38,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64719428] [2024-11-08 19:39:38,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:39:38,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:39:38,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:39:38,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:39:38,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:39:38,761 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 19:39:38,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:39:38,785 INFO L93 Difference]: Finished difference Result 117 states and 202 transitions. [2024-11-08 19:39:38,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:39:38,787 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 138 [2024-11-08 19:39:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:39:38,792 INFO L225 Difference]: With dead ends: 117 [2024-11-08 19:39:38,792 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 19:39:38,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 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-08 19:39:38,798 INFO L432 NwaCegarLoop]: 86 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, 86 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-08 19:39:38,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:39:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 19:39:38,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-08 19:39:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:39:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2024-11-08 19:39:38,831 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 138 [2024-11-08 19:39:38,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:39:38,832 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2024-11-08 19:39:38,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 19:39:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2024-11-08 19:39:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 19:39:38,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:39:38,835 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:39:38,854 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-08 19:39:39,035 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-08 19:39:39,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:39:39,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:39:39,037 INFO L85 PathProgramCache]: Analyzing trace with hash 194365649, now seen corresponding path program 1 times [2024-11-08 19:39:39,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:39:39,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205314181] [2024-11-08 19:39:39,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:39:39,038 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-08 19:39:39,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:39:39,041 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-08 19:39:39,042 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-08 19:39:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:39,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 19:39:39,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:39:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 19:39:39,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:39:39,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:39:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205314181] [2024-11-08 19:39:39,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205314181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:39:39,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:39:39,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:39:39,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868140942] [2024-11-08 19:39:39,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:39:39,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:39:39,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:39:39,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:39:39,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:39:39,536 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 19:39:41,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:39:44,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:39:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:39:44,906 INFO L93 Difference]: Finished difference Result 115 states and 171 transitions. [2024-11-08 19:39:44,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:39:44,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 138 [2024-11-08 19:39:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:39:44,908 INFO L225 Difference]: With dead ends: 115 [2024-11-08 19:39:44,908 INFO L226 Difference]: Without dead ends: 60 [2024-11-08 19:39:44,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 136 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-08 19:39:44,909 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 21 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:39:44,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 137 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-08 19:39:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-08 19:39:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-08 19:39:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:39:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-11-08 19:39:44,923 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 138 [2024-11-08 19:39:44,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:39:44,926 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-11-08 19:39:44,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 19:39:44,926 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-11-08 19:39:44,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 19:39:44,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:39:44,929 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:39:44,942 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-08 19:39:45,129 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-08 19:39:45,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:39:45,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:39:45,133 INFO L85 PathProgramCache]: Analyzing trace with hash -198661361, now seen corresponding path program 1 times [2024-11-08 19:39:45,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:39:45,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603247578] [2024-11-08 19:39:45,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:39:45,135 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-08 19:39:45,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:39:45,138 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-08 19:39:45,143 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-08 19:39:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:45,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 19:39:45,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:39:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 19:39:45,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:39:45,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:39:45,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603247578] [2024-11-08 19:39:45,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603247578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:39:45,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:39:45,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:39:45,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660544686] [2024-11-08 19:39:45,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:39:45,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:39:45,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:39:45,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:39:45,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:39:45,865 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 19:39:47,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:39:52,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:39:54,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:39:58,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:39:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:39:58,774 INFO L93 Difference]: Finished difference Result 167 states and 246 transitions. [2024-11-08 19:39:58,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:39:58,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 138 [2024-11-08 19:39:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:39:58,777 INFO L225 Difference]: With dead ends: 167 [2024-11-08 19:39:58,777 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 19:39:58,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:39:58,779 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 108 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-11-08 19:39:58,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 287 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 2 Unknown, 0 Unchecked, 12.8s Time] [2024-11-08 19:39:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 19:39:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 61. [2024-11-08 19:39:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:39:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2024-11-08 19:39:58,787 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 138 [2024-11-08 19:39:58,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:39:58,788 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2024-11-08 19:39:58,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 19:39:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2024-11-08 19:39:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 19:39:58,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:39:58,789 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:39:58,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 19:39:58,990 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-08 19:39:58,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:39:58,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:39:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash -620087973, now seen corresponding path program 1 times [2024-11-08 19:39:58,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:39:58,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306067736] [2024-11-08 19:39:58,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:39:58,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:39:58,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:39:58,994 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-08 19:39:58,995 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-08 19:39:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:59,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 19:39:59,457 INFO L278 TraceCheckSpWp]: Computing forward predicates...